{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:30:29Z","timestamp":1725571829441},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666264"},{"type":"electronic","value":"9783540480853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48085-3_26","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T22:25:21Z","timestamp":1292538321000},"page":"361-374","source":"Crossref","is-referenced-by-count":1,"title":["Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Prcovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of the 10th European Conference on Artificial Intelligence (1992)"},{"key":"26_CR2","unstructured":"Harvey, W.: Nonsystematic Backtracking Search. PhD thesis, Stanford University (1995)"},{"key":"26_CR3","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of 14th International Joint Conference on Artificial Intelligence (1995)"},{"key":"26_CR4","unstructured":"Korf, R.: Improved limited discrepancy search. In: Proceedings of the 13th AAAI Conference (1996)"},{"key":"26_CR5","unstructured":"Meseguer, P.: Interleaved Depth-First Search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1382\u20131387 (1997)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-49481-2_24","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"E. MacIntyre","year":"1998","unstructured":"MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Theory meeet practice. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 325\u2013339. Springer, Heidelberg (1998)"},{"key":"26_CR7","unstructured":"Meseguer, P., Walsh, T.: Interleaved and Discrepancy Based Search. In: Proceedings of the 13th European Conference on Artificial Intelligence (1998)"},{"key":"26_CR8","unstructured":"Prcovic, N.: Recherche arborescente parallle et squentielle pour les problems de satisfaction de contraintes. PhD thesis, Ecole Nationale des Ponts et Chausses (November 1998) (in French)"},{"key":"26_CR9","unstructured":"Walsh, T.: Depth-bounded discrepancy search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (1997)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48085-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T20:15:25Z","timestamp":1553285725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48085-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666264","9783540480853"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48085-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}