Feng-hsiung Hsu, T. Anthony Marsland, Robert Levinson (chairperson, Jonathan Schaeffer, David E Wilkins
Our eminent researchers including John McCarthy, Allen Newell, Claude Shannon, Herb Simon, Ken Thompson and Alan Turing put significant effort into computer chess research. Now that computers have...
Asynchronous Parallel Game-Tree Search (1998)
Mark Gordon Brockington, Mark Gordon Brockington, T. Anthony Marsland, John Samson, Murray Campbell
Tree searching is a fundamental and computationally intensive problem in artificial intelligence. Parallelization of tree-searching algorithms is one method of improving the speed of these...
Enhanced Iterative-Deepening Search (1994)
Alexander Reinefeld, Er Reinefeld, T. Anthony Marsland
Iterative-deepening searches mimic a breadth-#rst node expansion with a series of depth-#rst searches that operate with successively extended search horizons. They have been proposed as a simple way...
Heuristic Search in One and Two Player Games (1992)
T. Anthony Marsland, Alexander Reinefeld
With the continuing price-performance improvement of small computers there is growing interest in looking again at some of the heuristic techniques developed for problemsolving and planning programs,...
The deadlock problem: an overview (1980)
Sreekaanth S. Isloor, T. Anthony Marsland
Deadlock is a constant threat in terminal-oriented systems. This comprehensive study of deadlock-handling techniques introduces a method for on-line detection in distributed databases.
The deadlock problem: an overview (1980)
Sreekaanth S. Isloor, T. Anthony Marsland
Deadlock is a constant threat in terminal-oriented systems. This