Sciweavers

14739 search results - page 201 / 2948
» An optimization problem on the sphere
Sort
View
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 4 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ICDAR
2003
IEEE
15 years 4 months ago
Binary Classification Trees for Multi-class Classification Problems
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
Jin-Seon Lee, Il-Seok Oh
81
Voted
GECCO
1999
Springer
145views Optimization» more  GECCO 1999»
15 years 3 months ago
Three Ways to Grow Designs: A Comparison of Embryogenies for an Evolutionary Design Problem
This paper explores the use of growth processes, or embryogenies, to map genotypes to phenotypes within evolutionary systems. Following a summary of the significant features of em...
Peter J. Bentley, Sanjeev Kumar
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 2 months 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
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 2 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa