2152 search results - page 204 / 431 » Backward-chaining evolutionary algorithms |
130
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
124
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
133
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
133
click to vote
TIT
1998
15 years 3 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
108
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...