{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:05:15Z","timestamp":1743015915277,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437246"},{"type":"electronic","value":"9783540479222"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47922-8_5","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:27:28Z","timestamp":1179732448000},"page":"56-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Transposition Table Driven Work Scheduling in Distributed Game-Tree Search"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Kishimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,28]]},"reference":[{"issue":"3","key":"5_CR1","first-page":"162","volume":"19","author":"M. Brockington","year":"1996","unstructured":"Mark Brockington. A taxonomy of parallel game-tree search algorithms. International Computer Chess Association Journal, 19(3):162\u2013174, 1996.","journal-title":"International Computer Chess Association Journal"},{"key":"5_CR2","unstructured":"Mark Brockington. Asynchronous Parallel Game-Tree Search. PhD thesis, Department of Computing Science, University of Alberta, 1998."},{"key":"5_CR3","unstructured":"T. Dean and M. Boddy. An analysis of time-dependent planning. In AAAI National Conference, pages 49\u201354, 1988."},{"key":"5_CR4","unstructured":"Rainer Feldmann. Game Tree Search on Massively Parallel Systems. PhD thesis, University of Paderborn, August 1993."},{"key":"5_CR5","unstructured":"Akihiro Kishimoto. Transposition Table Driven Scheduling for Two-Player Games. Master\u2019s thesis, Department of Computing Science, University of Alberta, 2002."},{"key":"5_CR6","unstructured":"Bradley Kuszmaul. Synchronized MIMD Computing. PhD thesis, Massachusetts Institute of Technology, 1994."},{"key":"5_CR7","unstructured":"Tony Marsland. Relative performance of alpha-beta implementations. In International Joint Conference on Artificial Intelligence, pages 763\u2013766, 1983."},{"issue":"1\u20132","key":"5_CR8","first-page":"1","volume":"87","author":"A. Plaat","year":"1996","unstructured":"Aske Plaat, Jonathan Schaeffer, Wim Pijls, and Arie de Bruin. Best-first fixed-depth minimax algorithms. Artificial Intelligence, 87(1\u20132):1\u201338, 1996.","journal-title":"Artificial Intelligence"},{"key":"5_CR9","unstructured":"John Romein. Multigame-An Environment for Distributed Game-Tree Search. PhD thesis, Vrije Universitat Amsterdam, 2001."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"John Romein, Henri Bal, Jonathan Schaeffer, and Aske Plaat. A performance analysis of transposition-table-driven scheduling. IEEE Transactions on Parallel and Distributed Systems, 2001. To appear.","DOI":"10.1109\/TPDS.2002.1003855"},{"key":"5_CR11","unstructured":"John Romein, Aske Plaat, Henri Bal, and Jonathan Schaeffer. Transposition table driven work scheduling in distributed search. AAAI National Conference, pages 725\u2013731, 1999."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0743-7315(89)90044-0","volume":"6","author":"J. Schaeffer","year":"1989","unstructured":"Jonathan Schaeffer. Distributed game-tree searching. Journal of Parallel and Distributed Computing, 6:90\u2013114, 1989.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"David Slate and Larry Atkin. CHESS 4.5-The Northwestern University Chess Program. In Peter Frey, editor, Chess Skill in Man and Machine, pages 82\u2013118. Springer-Verlag, 1977.","DOI":"10.1007\/978-3-662-06239-5_4"},{"issue":"1","key":"5_CR14","first-page":"3","volume":"19","author":"J.-C. Weill","year":"1996","unstructured":"J.-C. Weill. The ABDADA distributed minmax-search algorithm. International Computer Chess Association Journal, 19(1):3\u201316, 1996.","journal-title":"International Computer Chess Association Journal"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47922-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:33:06Z","timestamp":1558258386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47922-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437246","9783540479222"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-47922-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"28 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}