Sciweavers

Share
GECCO
2010
Springer
217views Optimization» more  GECCO 2010»
8 years 6 months ago
Benchmarking CMA-EGS on the BBOB 2010 noiseless function testbed
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noiseless function testbed. The CMA-EGS is a hybrid strategy which combines elements from grad...
Steffen Finck, Hans-Georg Beyer
AAAI
2007
8 years 6 months ago
Best-First Search for Treewidth
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
P. Alex Dow, Richard E. Korf
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
8 years 7 months ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin
ICML
1994
IEEE
8 years 7 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
8 years 7 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
GECCO
2000
Springer
8 years 8 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
8 years 8 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
GECCO
2006
Springer
187views Optimization» more  GECCO 2006»
8 years 8 months ago
The gregarious particle swarm optimizer (G-PSO)
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
Srinivas Pasupuleti, Roberto Battiti
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
8 years 8 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
EVOW
2006
Springer
8 years 8 months ago
Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm
Abstract. The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Prev...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
books