Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

APHID: Asynchronous parallel game-tree search

From MaRDI portal
Publication:1974690
Jump to:navigation, search

DOI10.1006/jpdc.1999.1600zbMath0954.68064OpenAlexW1990000511MaRDI QIDQ1974690

Jonathan Schaeffer, Mark G. Brockington

Publication date: 7 May 2000

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ca1eaa8e46b7dbc03bd6f292e62a7b6404179bd7


zbMATH Keywords

search algorithmgame-tree searchAPHID


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (1)

Nagging: A scalable fault-tolerant paradigm for distributed search







This page was built for publication: APHID: Asynchronous parallel game-tree search

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1974690&oldid=14431975"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki