376 search results - page 47 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
67
Voted
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we present arithmetic real-coded variation operators tailored for time slot and turn optimization on TDMA-scheduled resources with evolutionary algorithms. Our opera...
TCBB
2008
14 years 9 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...
67
Voted
AAAI
1998
14 years 11 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...