Sciweavers

135 search results - page 4 / 27
» Real-Coded Genetic Algorithm for Solving Generalized Polynom...
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 14 days ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
14 years 7 days ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
ICTAI
2009
IEEE
14 years 3 months ago
Evolution Strategies for Constants Optimization in Genetic Programming
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
César Luis Alonso, José Luis Monta&n...
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 7 days ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
MFCS
2009
Springer
14 years 3 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...