Sciweavers

444 search results - page 59 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
13 years 9 months ago
A tree-based GA representation for the portfolio optimization problem
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
Claus de Castro Aranha, Hitoshi Iba
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 1 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
14 years 9 days ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
ESWA
2010
105views more  ESWA 2010»
13 years 6 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
PPSN
1998
Springer
14 years 27 days ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley