Sciweavers

894 search results - page 106 / 179
» Parameter-less evolutionary search
Sort
View
IAT
2007
IEEE
15 years 10 months ago
Web Mining in the EVA Intelligent Agent Architecture
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...
Philippe Millet, Jean-Claude Heudin
EVOW
2007
Springer
15 years 10 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
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...
Thomas Fischer, Peter Merz
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
15 years 9 months ago
Grammatical Constant Creation
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...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 9 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
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...
Bryant A. Julstrom
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 9 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
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...
Flaviu Adrian Marginean