Sciweavers

1155 search results - page 50 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
117
Voted
GECCO
2009
Springer
15 years 4 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
91
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 10 days ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
COR
2007
112views more  COR 2007»
15 years 14 days ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
GECCO
2003
Springer
15 years 5 months ago
Hybrid Networks of Evolutionary Processors
Abstract. A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the w...
Carlos Martín-Vide, Victor Mitrana, Mario J...
103
Voted
JMLR
2008
92views more  JMLR 2008»
15 years 14 days ago
Theoretical Advantages of Lenient Learners: An Evolutionary Game Theoretic Perspective
This paper presents the dynamics of multiple learning agents from an evolutionary game theoretic perspective. We provide replicator dynamics models for cooperative coevolutionary ...
Liviu Panait, Karl Tuyls, Sean Luke