715 search results - page 4 / 143 » Neighborhood structures for genetic local search algorithms |
135
click to vote
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
113
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...
107
click to vote
TCBB
2008
15 years 1 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
133
Voted
PAMI
2006
15 years 1 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
126
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...