1099 search results - page 68 / 220 » On the Complexity of Computing Evolutionary Trees |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
100
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: It has been suggested previously that genome and proteome sequences show characteristics typical of natural-language texts such as “signature-style” word usage ind...
FQAS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...