{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:29:49Z","timestamp":1740547789084,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153952"},{"type":"electronic","value":"9783642153969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15396-9_7","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T07:00:16Z","timestamp":1283756416000},"page":"53-60","source":"Crossref","is-referenced-by-count":4,"title":["Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP"],"prefix":"10.1007","author":[{"given":"David","family":"Allouche","sequence":"first","affiliation":[]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Nonserial Dynamic Programming","author":"U. Bertel\u00e9","year":"1972","unstructured":"Bertel\u00e9, U., Brioshi, F.: Nonserial Dynamic Programming. Academic Press, London (1972)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B. Cabon","year":"1999","unstructured":"Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.: Radio link frequency assignment. Constraints\u00a04, 79\u201389 (1999)","journal-title":"Constraints"},{"issue":"1-2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence\u00a0113(1-2), 41\u201385 (1999)","journal-title":"Artificial Intelligence"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.04.004","volume":"166","author":"K. Kask","year":"2005","unstructured":"Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying Cluster-Tree Decompositions for Reasoning in Graphical models. Artificial Intelligence\u00a0166(1-2), 165\u2013193 (2005)","journal-title":"Artificial Intelligence"},{"key":"7_CR6","unstructured":"Larrosa, J., de Givry, S., Heras, F., Zytnicki, M.: Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In: Proc. of the 19th IJCAI, Edinburgh, Scotland, pp. 84\u201389 (August 2005)"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. Lauritzen","year":"1988","unstructured":"Lauritzen, S., Spiegelhalter, D.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society \u2013 Series B\u00a050, 157\u2013224 (1988)","journal-title":"Journal of the Royal Statistical Society \u2013 Series B"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C. Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artificial Intelligence\u00a0173, 1592\u20131614 (2009)","journal-title":"Artificial Intelligence"},{"key":"7_CR9","unstructured":"Otten, L., Dechter, R.: Towards parallel search for optimization in graphical models. In: Proc. of ISAIM 2010. Fort Lauderdale (FL), USA (2010)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Rose, D.: Tringulated graphs and the elimination process. Journal of Mathematical Analysis and its Applications\u00a032 (1970)","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"7_CR11","unstructured":"Sanchez, M., Allouche, D., de Givry, S., Schiex, T.: Russian doll search with tree decomposition. In: Proc. IJCAI 2009, San Diego, CA, USA, pp. 603\u2013608 (2009)"},{"key":"7_CR12","unstructured":"Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. In: Proc. of the 14th IJCAI, Montr\u00e9al, Canada, pp. 631\u2013637 (August 1995)"},{"key":"7_CR13","unstructured":"Xia, Y., Prasanna, V.: Parallel Exact Inference. In: Bischof, C., B\u00fccker, M., Gibbon, P. (eds.) Parallel Computing 2007. NIC, vol.\u00a038, pp. 185\u2013192. John von Neumann Institute for Computing (September 2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15396-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T15:58:07Z","timestamp":1740499087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15396-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153952","9783642153969"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15396-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}