Sciweavers

35 search results - page 6 / 7
» Rediscovering *-Minimax Search
Sort
View
ANOR
2007
166views more  ANOR 2007»
13 years 5 months ago
Memetic particle swarm optimization
Abstract We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in a...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
AAAI
1996
13 years 7 months ago
Exploiting Graph Properties of Game Trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...
ACG
2009
Springer
14 years 11 days ago
Deriving Concepts and Strategies from Chess Tablebases
Abstract. Complete tablebases, indicating best moves for every position, exist for chess endgames. There is no doubt that tablebases contain a wealth of knowledge, however, mining ...
Matej Guid, Martin Mozina, Aleksander Sadikov, Iva...
ICMLA
2003
13 years 7 months ago
A Distributed Reinforcement Learning Approach to Pattern Inference in Go
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
Myriam Abramson, Harry Wechsler
FMCAD
2004
Springer
13 years 9 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar