{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:22:05Z","timestamp":1751098925851},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_45","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"596-610","source":"Crossref","is-referenced-by-count":38,"title":["Embarrassingly Parallel Search"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Rezgui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Malapert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H.: Experiments with Massively Parallel Constraint Solving. In: Boutilier, C. (ed.) IJCAI, pp. 443\u2013448 (2009)"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-Based Work Stealing in Parallel Constraint Programming. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 226\u2013241. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04244-7_20"},{"issue":"1","key":"45_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/ijoc.1040.0107","volume":"18","author":"G. Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G., Karamanov, M., Li, Y.: Early Estimates of the Size of Branch-and-Bound Trees. INFORMS Journal on Computing\u00a018(1), 86\u201396 (2006)","journal-title":"INFORMS Journal on Computing"},{"key":"45_CR4","unstructured":"Gent, I.P., Jefferson, C., Miguel, I., Moore, N.C.A., Nightingale, P., Prosser, P., Unsworth, C.: A Preliminary Review of Literature on Parallel Constraint Solving. In: Proceedings PMCS 2011 Workshop on Parallel Methods for Constraint Solving (2011)"},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1020594125144","volume":"7","author":"Y. Hamadi","year":"2002","unstructured":"Hamadi, Y.: Optimal Distributed Arc-Consistency. Constraints\u00a07, 367\u2013385 (2002)","journal-title":"Constraints"},{"key":"45_CR6","unstructured":"Jaffar, J., Santosa, A.E., Yap, R.H.C., Zhu, K.Q.: Scalable Distributed Depth-First Search with Greedy Work Stealing. In: ICTAI, pp. 98\u2013103. IEEE Computer Society (2004)"},{"key":"45_CR7","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Estimating Search Tree Size. In: AAAI, pp. 1014\u20131019 (2006)"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E.: Estimating the efficiency of backtrack programs. Mathematics of Computation\u00a029, 121\u2013136 (1975)","journal-title":"Mathematics of Computation"},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. Korf","year":"1985","unstructured":"Korf, R.: Depth-first Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence\u00a027, 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"45_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/ijoc.1080.0313","volume":"21","author":"L. Michel","year":"2009","unstructured":"Michel, L., See, A., Van Hentenryck, P.: Transparent Parallelization of Constraint Programming. INFORMS Journal on Computing\u00a021(3), 363\u2013382 (2009)","journal-title":"INFORMS Journal on Computing"},{"key":"45_CR11","unstructured":"MiniZinc (2012), \n                    \n                      http:\/\/www.g12.csse.unimelb.edu.au\/minizinc\/"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Perron, L.: Search Procedures and Parallelism in Constraint Programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 346\u2013361. Springer, Heidelberg (1999)","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"45_CR13","unstructured":"R\u00e9gin, J.-C.: (2013), \n                    \n                      http:\/\/www.constraint-programming.com\/people\/regin\/papers"},{"key":"45_CR14","unstructured":"Schulte, C.: Parallel Search Made Simple. In: Beldiceanu, N., Harvey, W., Henz, M., Laburthe, F., Monfroy, E., M\u00fcller, T., Perron, L., Schulte, C. (eds) Proceedings of TRICS: Techniques for Implementing Constraint programming Systems, a Post-Conference Workshop of CP 2000, Singapore (September 2000)"},{"key":"45_CR15","unstructured":"Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Application Using Networked Workstations and Parallel Computers, 2nd edn. Prentice-Hall Inc. (2005)"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Xie, F., Davenport, A.: Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 334\u2013338. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13520-0_36"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Yun, X., Epstein, S.L.: A Hybrid Paradigm for Adaptive Parallel Search. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 720\u2013734. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-33558-7_52"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Zoeteweij, P., Arbab, F.: A Component-Based Parallel Constraint Solver. In: De Nicola, R., Ferrari, G.-L., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol.\u00a02949, pp. 307\u2013322. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24634-3_23"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T02:02:08Z","timestamp":1558058528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}