894 search results - page 106 / 179 » Parameter-less evolutionary search |
100
Voted
IAT
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper describes the architecture of the fourth version of the Evolutionary Virtual Agent (EVA). This new light-weight java-based implementation is based on a dynamical rule-b...
151
click to vote
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
102
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
129
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
120
click to vote
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...