Sciweavers

498 search results - page 75 / 100
» An Evolutionary Algorithm to Solve Cryptarithmetic Problem
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 19 days ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
EOR
2007
89views more  EOR 2007»
13 years 8 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
14 years 2 months ago
Experimental analysis of binary differential evolution in dynamic environments
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...
Alp Emre Kanlikilicer, Ali Keles, Sima Uyar
AHS
2006
IEEE
138views Hardware» more  AHS 2006»
14 years 2 months ago
Generalized Disjunction Decomposition for the Evolution of Programmable Logic Array Structures
Evolvable hardware refers to a self reconfigurable electronic circuit, where the circuit configuration is under the control of an evolutionary algorithm. Evolvable hardware has sh...
Emanuele Stomeo, Tatiana Kalganova, Cyrille Lamber...
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
13 years 9 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...