{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:46Z","timestamp":1725664246761},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:10:39Z","timestamp":1330269039000},"page":"153-168","source":"Crossref","is-referenced-by-count":4,"title":["An efficient implementation of parallel A*"],"prefix":"10.1007","author":[{"given":"Van -Dat","family":"Cung","sequence":"first","affiliation":[]},{"given":"Bertrand","family":"Cun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"14_CR1","unstructured":"Aho (A.), Hopcroft (J.) et Ullman (J.).-The Design and Analysis of Computer Algorithms.-Addison-Wesley, 1974."},{"key":"14_CR2","first-page":"540","volume":"30","author":"(C.) Aragon","year":"1989","unstructured":"Aragon (C.) et Aragon R. (G. S.).-Randomized search trees. FOCS 30, 1989, pp. 540\u2013545.","journal-title":"FOCS"},{"key":"14_CR3","unstructured":"Calhoun (J.) et Ford (R.).-Concurrency control mechanisms and the serializability of concurrent tree algorithms. In: of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.-Waterloo Ontario, Avr. 1984. Debut de la theorie sur la serializability."},{"key":"14_CR4","unstructured":"Cun (B. L.), Mans (B.) et Roucairol (C.).-Op\u00e9rations concurrentes et files de priorit\u00e9.-RR n\u2218 1548, INRIA-Rocquencourt, 1991."},{"key":"14_CR5","unstructured":"Cung (V.-D.) et Roucairol (C.).-Parcours parall\u00e8le de graphes d'\u00e9tats par des algorithmes de la famille A * en Intelligence Artificielle.-RR n\u2218 1900, INRIA, Avr. 1993. In French."},{"issue":"n\u22189","key":"14_CR6","first-page":"811","volume":"C-29","author":"(C.) Ellis","year":"1981","unstructured":"Ellis (C.).-Concurrent search and insertion in avl trees. IEEE Trans. on Cumputers, vol. C-29, n\u2218 9, Sept. 1981, pp. 811\u2013817.","journal-title":"IEEE Trans. on Cumputers"},{"key":"14_CR7","unstructured":"Grama (A. Y.) et Kumar (V.).-A survey of parallel search algorithms for discrete optimization problems.-Personnal communication, 1993."},{"issue":"n\u22181","key":"14_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/63238.63249","volume":"32","author":"(D.) Jones","year":"1989","unstructured":"Jones (D.).-Concurrent operations on priority queues. ACM, vol. 32, n\u2218 1, Jan. 1989, pp. 132\u2013137.","journal-title":"ACM"},{"issue":"n\u22184","key":"14_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01379360","volume":"19","author":"(L.) Kal\u00e9","year":"1990","unstructured":"Kal\u00e9 (L.) et Saletore (V. A.).-Parallel state-space search for a first solution with consistent linear speedups. International journal of Parallel Programming, vol. 19, n\u2218 4, 1990, pp: 251\u2013293.","journal-title":"International journal of Parallel Programming"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"no27","author":"(. E. Korf","year":"1985","unstructured":"Korf (R. E.).-Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, no27, 1985, pp. 97\u2013109.","journal-title":"Artificial Intelligence"},{"key":"14_CR11","unstructured":"Kumar (V.), Ramesh (K.) et Rao (V. N.).-Parallel best-first search of state-space graphs: A summary of results. The AAAI Conference, 1987, pp. 122\u2013127."},{"issue":"n\u22183","key":"14_CR12","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","volume":"5","author":"(H.) Kung","year":"1980","unstructured":"Kung (H.) et Lehman (P.).-Concurrent manipulation of binary search trees. ACM trans. on Database Systems, vol. 5, n\u2218 3, 1980, pp. 354\u2013382.","journal-title":"ACM trans. on Database Systems"},{"issue":"n\u22184","key":"14_CR13","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"(P.) Lehman","year":"1981","unstructured":"Lehman (P.) et Yao (S.).-Efficient locking for concurrent operation on b-tree. ACM trans. on Database Systems, vol. 6, n\u2218 4, D\u00e9c. 1981, pp. 650\u2013670.","journal-title":"ACM trans. on Database Systems"},{"key":"14_CR14","volume-title":"Rapport technique n\u2218 UMIACS-TR-91-41, CS-TR-2633","author":"(A.) Mahanti","year":"1991","unstructured":"Mahanti (A.) et Daniels (C. J.).-SIMD Parallel Heuristic Search.-Rapport technique n\u2218 UMIACS-TR-91-41, CS-TR-2633, College Park, Maryland, Computer Science Department, University of Maryland, Mai 1991."},{"key":"14_CR15","unstructured":"Mans (B.) et Roucairol (C.).-Concurrency in priority queues for branch and bound algorithms.-RR n\u2218 1311, INRIA-Rocquencourt, Oct. 1990."},{"issue":"n\u22182","key":"14_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"(. M. McCreight","year":"1985","unstructured":"McCreight (E. M.).-Priority search trees. SIAM J Computing, vol. 14, n\u2218 2, Mai 1985, pp. 257\u2013276.","journal-title":"SIAM J Computing"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(84)90004-3","volume":"23","author":"(. S. Nau","year":"1984","unstructured":"Nau (D. S.), Kumar (V.) et Kanal (L.).-General branch and bound, and its relation to a* and ao*. Artificial Intelligence, vol. 23, 1984, pp. 29\u201358.","journal-title":"Artificial Intelligence"},{"key":"14_CR18","unstructured":"Nilsson (N. J.).-Principles of Artificial Intelligence.-Tioga Publishing Co., 1980."},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01543478","volume":"5","author":"(. G. Patrick","year":"1992","unstructured":"Patrick (B. G.), Almulla (M.) et Newborn (M. M.).-An upper bound on the time complexity of iterative-deepening-a*. Annals of Mathematics and Artificial Intelligence, vol. 5, 1992, pp. 265\u2013278.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"14_CR20","unstructured":"Pearl (J.).-Heuristics.-Addison-Wesley, 1984."},{"key":"14_CR21","unstructured":"Powley (C.), Ferguson (C.) et Korf (R. E.).-Parallel tree search on a simd machine. In: The Third IEEE Symposium on Parallel and Distributed Processing.-D\u00e9c. 1991."},{"key":"14_CR22","unstructured":"Powley (C.) et Korf (R. E.).-Simd and mimd parallel search. In: The AAAI symposium on Planning and Search.-Mars 1989."},{"issue":"n\u22185","key":"14_CR23","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/34.134045","volume":"13","author":"(C.) Powley","year":"1991","unstructured":"Powley (C.) et Korf (R. E.).-Single-agent parallel window search. IEEE Transactions on pattern analysis and machine intelligence, vol. 13, n\u2218 5, Mai 1991, pp. 466\u2013477.","journal-title":"IEEE Transactions on pattern analysis and machine intelligence"},{"key":"14_CR24","unstructured":"Rao (V.) et Kumar (V.).-Concurrent insertions and deletions in a priority queue. IEEE proceedings of International Conference on Parallele Processing, 1988, pp. 207\u2013211."},{"key":"14_CR25","volume-title":"Rapport technique n\u2218 AI85-45","author":"(. N. Rao","year":"1987","unstructured":"Rao (V. N.), Kumar (V.) et Ramesh (K.).-Parallel Heuristic Search on Shared Memory Multiprocessors: Preliminary Results.-Rapport technique n\u2218 AI85-45, Artificial Intelligence Laboratory, The University of Texas at Austin, Juin 1987."},{"key":"14_CR26","volume-title":"RR n\u2218 M.A.S.I. 90.4","author":"(C.) Roucairol","year":"1990","unstructured":"Roucairol (C.).-Recherche arborescente en parall\u00e8le.-RR n\u2218 M.A.S.I. 90.4, Institut Blaise Pascal-Paris VI, 1990. In French."},{"key":"14_CR27","unstructured":"Roucairol (C.).-Exploration parall\u00e8le d'espace de recherche en recherche op\u00e9rationnelle et intelligence artificielle. In: Algorithmique parall\u00e8le, \u00e9d. par Cosnard (M.), Nivat (M.) et Robert (Y.), pp. 201\u2013211.-Masson, 1992. In French."},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Sleator (D.) et Tarjan (R.).-Self-adjusting trees. In: 15th ACM Symposium on theory of computing, pp. 235\u2013246.-Avr. 1983.","DOI":"10.1145\/800061.808752"},{"issue":"n\u22181","key":"14_CR29","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"(D.) Sleator","year":"1986","unstructured":"Sleator (D.) et Tarjan (R.).-Self-adjusting heaps. SIAM J. Comput., vol. 15, n\u2218 1, F\u00e9v. 1986, pp. 52\u201369.","journal-title":"SIAM J. Comput."},{"issue":"n\u22183","key":"14_CR30","first-page":"652","volume":"32","author":"(R.) Tarjan","year":"1985","unstructured":"Tarjan (R.) et Sleator (D.).-Self-adjusting binary search trees. Journal of ACM, vol. 32, n\u2218 3, 1985, pp. 652\u2013686.","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:43Z","timestamp":1605647803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}