Sciweavers

895 search results - page 111 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 2 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
DCOSS
2009
Springer
15 years 5 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
AI
1999
Springer
14 years 10 months ago
Learning Action Strategies for Planning Domains
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
Roni Khardon
CEC
2009
IEEE
15 years 3 months ago
Automatic clustering with multi-objective Differential Evolution algorithms
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...
Kaushik Suresh, Debarati Kundu, Sayan Ghosh, Swaga...
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
15 years 1 days ago
Adapted Pittsburgh classifier system: building accurate strategies in non markovian environments
This paper focuses on the study of the behavior of a genetic algorithm based classifier system, the Adapted Pittsburgh Classifier System (A.P.C.S), on maze type environments con...
Gilles Énée, Mathias Péroumal...