{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:51Z","timestamp":1725664611684},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602224"},{"type":"electronic","value":"9783540447542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60222-4_128","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:54:55Z","timestamp":1330278895000},"page":"400-410","source":"Crossref","is-referenced-by-count":0,"title":["Distributing search and knowledge using a coordination language"],"prefix":"10.1007","author":[{"given":"P.","family":"Ciancarini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Mancini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0167-739X(91)90001-E","volume":"6","author":"H. Bal","year":"1991","unstructured":"H. Bal. Heuristic search in PARLOG using replicated worker style parallelism. Future Generation Computer Systems, 6:303\u2013315, 1991.","journal-title":"Future Generation Computer Systems"},{"key":"38_CR2","volume-title":"How to Write Parallel Programs: A First Course","author":"N. Carriero","year":"1990","unstructured":"N. Carriero and D. Gelernter. How to Write Parallel Programs: A First Course. MIT Press, Cambridge, MA, 1990."},{"unstructured":"C.Ebeling. All the Right Moves: A VLSI Architecture for Chess. MIT Press, 1986.","key":"38_CR3"},{"key":"38_CR4","volume-title":"Technical Report UBLCS-94-14","author":"P. Ciancarini","year":"1994","unstructured":"P. Ciancarini. A Comparison of Parallel Search Algorithms based on Tree Splitting. Technical Report UBLCS-94-14, Comp. Science Laboratory, Universit\u00e0 di Bologna, Italy, May 1994."},{"key":"38_CR5","volume-title":"PhD thesis","author":"F. Hsu","year":"1990","unstructured":"F. Hsu. Large scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, Feb 1990."},{"unstructured":"G.Baudet. The Design and Analysis of Algorithms for Asynchronous Multiprocessors. PhD thesis, Carnegie-Mellon Univ., Apr 1978.","key":"38_CR6"},{"key":"38_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-739X(92)90034-9","volume":"8","author":"H. Bal","year":"1992","unstructured":"H. Bal. A comparative study of five parallel programming languages. Future Generation Computer Systems, 8:121\u2013135, 1992.","journal-title":"Future Generation Computer Systems"},{"doi-asserted-by":"crossref","unstructured":"H.Bal and R.vanRenesse. A summary of parallel alpha-beta search results. Journal of the Int. Computer Chess Association, pages 146\u2013149, Sept 1986.","key":"38_CR8","DOI":"10.3233\/ICG-1986-9304"},{"key":"38_CR9","volume-title":"PhD thesis","author":"J. Schaeffer","year":"1986","unstructured":"J. Schaeffer. Experiments in search and knowledge. PhD thesis, University of Alberta, Edmonton, Canada, Jul 1986."},{"issue":"4","key":"38_CR10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/356893.356895","volume":"14","author":"T. Marsland","year":"1982","unstructured":"T. Marsland and M. Campbell. Parallel search of strongly ordered game trees. ACM Computing Surveys, 14(4):533\u2013551, 1982.","journal-title":"ACM Computing Surveys"},{"unstructured":"T. Marsland, M. Olafsson, and J.Schaeffer. Multiprocessor tree-search experiments. In Advances in Computer Chess 4, pages 37\u201351. Pergamon Press, 1986.","key":"38_CR11"},{"key":"38_CR12","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/0167-8191(94)90032-9","volume":"20","author":"N. Carriero","year":"1994","unstructured":"N. Carriero, D. Gelernter, T. Mattson, and A. Sherman. The Linda Alternative to Message-passing Systems. Parallel Computing, 20:633\u2013655, 1994.","journal-title":"Parallel Computing"},{"key":"38_CR13","volume-title":"Master's thesis","author":"R. Elias","year":"1990","unstructured":"R. Elias. Oracol, A Chess Problem Solver in Orca. Master's thesis, Dept. of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, 1990."},{"unstructured":"R.Feldmann, P.Mysliwietz, and B.Monien. Experiments with a fully-distributed chess program. In J. VanDenHerik and V. Allis, editors, Heuristic Programming in AI, pages 72\u201387. Ellis Horwood, 1992.","key":"38_CR14"},{"issue":"2","key":"38_CR15","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TPAMI.1982.4767226","volume":"4","author":"S. Akl","year":"1982","unstructured":"S. Akl, D. Barnard, and R. Doran. Design, analysis, and implementation of a parallel tree search algorithm. IEEE Trans. on Pattern Analysis and Machine Intelligence, 4(2):192\u2013203, 1982.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"38_CR16","volume-title":"Technical report","author":"J. Schaeffer","year":"1987","unstructured":"J. Schaeffer. Experiments in distributed game-tree searching. Technical report, University of Alberta, Edmonton, Canada, Jan 1987."},{"key":"38_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0743-7315(89)90044-0","volume":"6","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer. Distributed game-tree searching. Journal of Parallel and Distributed Computing, 6:90\u2013114, 1989.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"38_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00127839","volume":"5","author":"L. Stiller","year":"1991","unstructured":"L. Stiller. Group graphs and computational symmetry on massively parallel architecture. The Journal of Supercomputing, 5:99\u2013117, 1991.","journal-title":"The Journal of Supercomputing"},{"issue":"3","key":"38_CR19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/cpe.4330030306","volume":"3","author":"T. Marsland","year":"1991","unstructured":"T. Marsland, T. Breitkreutz, and S. Sutphen. A network multiprocessor for experiments in parallelism. Concurrency: Practice and Experience, 3(3):203\u2013219, 1991.","journal-title":"Concurrency: Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60222-4_128.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:21Z","timestamp":1605646581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60222-4_128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602224","9783540447542"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60222-4_128","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}