Sciweavers

1639 search results - page 185 / 328
» Anytime Heuristic Search
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 18 days ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
AISB
1995
Springer
14 years 15 days ago
Specialised Recombinative Operators for Timetabling Problems
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
Edmund K. Burke, Dave Elliman, Rupert F. Weare
TABLEAUX
2000
Springer
14 years 15 days ago
Matrix-Based Inductive Theorem Proving
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
Christoph Kreitz, Brigitte Pientka
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
14 years 11 days ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
EOR
2008
91views more  EOR 2008»
13 years 9 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini