{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:52:08Z","timestamp":1725501128620},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75755-9_128","type":"book-chapter","created":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T02:44:54Z","timestamp":1190429094000},"page":"1105-1114","source":"Crossref","is-referenced-by-count":0,"title":["Performance Analysis of Two Parallel Game-Tree Search Applications"],"prefix":"10.1007","author":[{"given":"Yurong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ying","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Yimin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Carole","family":"Dulong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"128_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.3846\/13926292.2005.9637283","volume":"10","author":"M. Baravykait\u0117","year":"2005","unstructured":"Baravykait\u0117, M., \u010ciegis, R., \u017dilinskas, J.: Template Realization of the Generalized Branch and Bound Algorithm. Mathematical Modelling and Analysis\u00a010(3), 217\u2013236 (2005)","journal-title":"Mathematical Modelling and Analysis"},{"key":"128_CR2","unstructured":"Le, C.B., Roucairol, C.: BOB: a Unified Platform for Implementing Branch-and-Bound like Algorithms. Technical Reports, No.95\/16, Universiti de Versailles Saint Quentin (1995)"},{"key":"128_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D. Knuth","year":"1975","unstructured":"Knuth, D., Moore, R.: An Analysis of Alpha-Beta Pruning. Artificial Intelligence\u00a06, 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"128_CR4","first-page":"3","volume":"9","author":"T.A. MarsLand","year":"1986","unstructured":"MarsLand, T.A.: A Review of Game-Tree Pruning. Int. Comp. Chess Assoc. Journal\u00a09(1), 3\u201319 (1986)","journal-title":"Int. Comp. Chess Assoc. Journal"},{"key":"128_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/228329.228344","volume-title":"Proc. of ACM 24th annual conference on Computer Science","author":"J. Schaeffer","year":"1996","unstructured":"Schaeffer, J., Plaat, A.: New Advances in Alpha-Beta Searching. In: Proc. of ACM 24th annual conference on Computer Science, pp. 124\u2013130. ACM Press, New York (1996)"},{"issue":"3","key":"128_CR6","first-page":"162","volume":"19","author":"M.G. Brockington","year":"1996","unstructured":"Brockington, M.G.: A Taxonomy of Parallel Game-Tree Search Algorithms. Int. Comp. Chess Assoc. Journal\u00a019(3), 162\u2013175 (1996)","journal-title":"Int. Comp. Chess Assoc. Journal"},{"key":"128_CR7","doi-asserted-by":"crossref","unstructured":"Joerg, C.F., Kuszmaul, B.C.: The *Socrates Massively Parallel Chess Program. In: Bhatt S.N. (ed.) Parallel Mathematics and Theoretical Computer Science, vol. 30, pp. 117\u2013140. American Mathematical Society, Providence, RI (1996)","DOI":"10.1090\/dimacs\/030\/08"},{"key":"128_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(02)00195-9","volume":"137","author":"Y. Shoham","year":"2002","unstructured":"Shoham, Y., Toledo, S.: Parallel Randomized Best-Fisrt MiniMax Search. Artificial Intelligence\u00a0137, 165\u2013196 (2002)","journal-title":"Artificial Intelligence"},{"key":"128_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"R.E. Korf","year":"1975","unstructured":"Korf, R.E., Chickering, D.M.: Best-First Minimax Search. Artificial Intelligence\u00a06, 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"128_CR10","unstructured":"Hyatt, R.M.: Crafty, Computer program, ftp:\/\/ftp.cis.uab.edu\/pub\/hyatt"},{"issue":"1","key":"128_CR11","first-page":"3","volume":"20","author":"R.M. Hyatt","year":"1997","unstructured":"Hyatt, R.M.: The Dynamic Tree-Splitting Parallel Search Algorithm. Int. Comp. Chess Assoc. Journal\u00a020(1), 3\u201319 (1997)","journal-title":"Int. Comp. Chess Assoc. Journal"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75755-9_128.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:30:57Z","timestamp":1619519457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75755-9_128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540757542"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75755-9_128","relation":{},"subject":[]}}