Sciweavers

GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 5 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 5 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
GECCO
2010
Springer
140views Optimization» more  GECCO 2010»
13 years 5 months ago
Shared memory genetic algorithms in a multi-agent context
In this paper we present a concurrent implementation of genetic algorithms designed for shared memory architectures intended to take advantage of multi-core processor platforms. O...
Dana Vrajitoru
GECCO
2010
Springer
232views Optimization» more  GECCO 2010»
13 years 6 months ago
Genetic algorithms for automatic classification of moving objects
This paper presents an integrated approach, combining a state-of-the-art commercial object detection system and genetic algorithms (GA)-based learning for automatic object classif...
Omid David-Tabibi, Nathan S. Netanyahu, Yoav Rosen...
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
13 years 6 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 6 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
GECCO
2010
Springer
177views Optimization» more  GECCO 2010»
13 years 6 months ago
Comparison of cauchy EDA and G3PCX algorithms on the BBOB noiseless testbed
Estimation-of-distribution algorithm equipped with Cauchy sampling distribution is compared with the generalized generation gap algorithm with parent centric crossover. Both algor...
Petr Posík
GECCO
2010
Springer
347views Optimization» more  GECCO 2010»
13 years 7 months ago
Comparison of cauchy EDA and BIPOP-CMA-ES algorithms on the BBOB noiseless testbed
Estimation-of-distribution algorithm using Cauchy sampling distribution is compared with the bi-population CMA evolutionary strategy which was one of the best contenders in the bl...
Petr Posík
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 7 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 7 months ago
Black-box optimization benchmarking for noiseless function testbed using artificial bee colony algorithm
This paper benchmarks the Artificial Bee Colony (ABC) algorithm using the noise-free BBOB 2010 testbed. The results show how this algorithm is highly successful in the separable a...
Mohammed El-Abd