Sciweavers

699 search results - page 110 / 140
» A new representation in evolutionary algorithms for the opti...
Sort
View
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 26 days ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison
CVPR
2009
IEEE
15 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
14 years 1 months ago
Toward a better understanding of rule initialisation and deletion
A number of heuristics have been used in Learning Classifier Systems to initialise parameters of new rules, to adjust fitness of parent rules when they generate offspring, and ...
Tim Kovacs, Larry Bull
CEC
2009
IEEE
14 years 2 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...
SOCO
2010
Springer
13 years 2 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...