Sciweavers

9209 search results - page 312 / 1842
» Data Space Randomization
Sort
View
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 10 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
AAAI
2008
15 years 9 months ago
Measuring the Hardness of SAT Instances
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
AAAI
2010
15 years 6 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 6 months ago
Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm
This paper combines the idea of a hierarchical distributed genetic algorithm with different interagent partnering strategies. Cascading clusters of sub-populations are built from ...
Uwe Aickelin, Larry Bull
GPEM
2000
103views more  GPEM 2000»
15 years 6 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon