{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:11:35Z","timestamp":1725559895420},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278726"},{"type":"electronic","value":"9783540318828"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527862_35","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:48:01Z","timestamp":1279655281000},"page":"365-366","source":"Crossref","is-referenced-by-count":0,"title":["Model-Based Search"],"prefix":"10.1007","author":[{"given":"Wheeler","family":"Ruml","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Ruml, W.: Incomplete tree search using adaptive probing. In: Proceedings of IJCAI 2001, pp. 235\u2013241 (2001)"},{"key":"35_CR2","unstructured":"Ruml, W.: Heuristic search in bounded-depth trees: Best-leaf-first search. In: Working Notes of the AAAI 2002 Workshop on Probabilistic Approaches in Search (2002)"},{"key":"35_CR3","first-page":"286","volume-title":"Proceedings of AAAI 1996","author":"R.E. Korf","year":"1996","unstructured":"Korf, R.E.: Improved limited discrepancy search. In: Proceedings of AAAI 1996, pp. 286\u2013291. MIT Press, Cambridge (1996)"},{"key":"35_CR4","unstructured":"Ruml, W.: Adaptive Tree Search. PhD thesis, Harvard University (2002)"},{"key":"35_CR5","unstructured":"Fang, H., Ruml, W.: Complete local search for propositional satisfiability. In: Proceedings of AAAI 2004 (2004)"},{"key":"35_CR6","unstructured":"Ruml, W., Crawford, E.: Best-first search when time matters. In: Working Notes of the IJCAI 2005 Workshop on Planning and Learning in A Priori Unknown or Dynamic Domains (2005)"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527862_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:04Z","timestamp":1619506144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527862_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278726","9783540318828"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11527862_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}