GECCO
2010
Springer
13 years 6 months ago
2010
Springer
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...
AAAI
2007
13 years 6 months ago
2007
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...
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
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...
ICML
1994
IEEE
13 years 8 months ago
1994
IEEE
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 ...
WEBDB
2000
Springer
13 years 8 months ago
2000
Springer
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...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
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 ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
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...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
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...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
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...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
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...