Sciweavers

65 search results - page 8 / 13
» Heuristic Search Applied to Abstract Combat Games
Sort
View
SEAL
1998
Springer
15 years 10 months ago
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
Edmund K. Burke, Patrick De Causmaecker, Greet Van...
214
Voted
EVOW
2007
Springer
16 years 11 days ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
CG
2010
Springer
15 years 4 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
ACG
2003
Springer
15 years 11 months ago
Opponent-Model Search in Bao: Conditions for a Successful Application
Abstract Opponent-Model search is a game-tree search method that explicitly uses knowledge of the opponent. There is some risk involved in using Opponent-Model search. Both the pre...
H. H. L. M. Donkers, H. Jaap van den Herik, Jos W....
CIG
2006
IEEE
16 years 8 days ago
Temporal Difference Learning Versus Co-Evolution for Acquiring Othello Position Evaluation
Abstract— This paper compares the use of temporal difference learning (TDL) versus co-evolutionary learning (CEL) for acquiring position evaluation functions for the game of Othe...
Simon M. Lucas, Thomas Philip Runarsson