13987 search results - page 171 / 2798 » The Two Guards Problem |
149
Voted
EVOW
2005
Springer
15 years 9 months ago
2005
Springer
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...
134
click to vote
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
219
Voted
ICAISC
2004
Springer
15 years 9 months ago
2004
Springer
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
100
Voted
ISAAC
1994
Springer
15 years 7 months ago
1994
Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
101
click to vote
MFCS
1994
Springer
15 years 7 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...