Sciweavers

699 search results - page 31 / 140
» The method of combinatorial telescoping
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 4 days ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
AAAI
2004
13 years 10 months ago
Temperature Discovery Search
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
Martin Müller 0003, Markus Enzenberger, Jonat...
ACL
1998
13 years 9 months ago
Deriving the Predicate-Argument Structure for a Free Word Order Language
In relatively free word order languages, grammatical functions are intricately related to case marking. Assuming an ordered representation of the predicate-argument structure, thi...
Cem H. Bozsahin
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
13 years 9 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
EOR
2008
156views more  EOR 2008»
13 years 8 months ago
Ant colony optimization for continuous domains
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
Krzysztof Socha, Marco Dorigo