2157 search results - page 195 / 432 » Binary ant algorithm |
177
Voted
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
149
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
191
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
138
Voted
DAGSTUHL
2007
15 years 7 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
181
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...