14518 search results - page 191 / 2904 » Two Problems for Sophistication |
FOCS
2005
IEEE
14 years 4 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
CP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
EVOW
2005
Springer
14 years 4 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...
ICNC
2005
Springer
14 years 4 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 ...
ICAISC
2004
Springer
14 years 4 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...