{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:56Z","timestamp":1725484316112},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439417"},{"type":"electronic","value":"9783540456223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45622-8_38","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T14:45:20Z","timestamp":1179931520000},"page":"345-346","source":"Crossref","is-referenced-by-count":0,"title":["Principled Exploitation of Heuristic Information"],"prefix":"10.1007","author":[{"given":"Wheeler","family":"Ruml","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"38_CR1","unstructured":"Ruml, Wheeler. 2001a. Incomplete tree search using adaptive probing. In Proceedings of IJCAI-01, pages 235\u2013241."},{"key":"38_CR2","unstructured":"Ruml, Wheeler. 2001b. Stochastic tree search: Where to put the randomness? In Holger H. Hoos and Thomas G. St\u00fctzle, editors, Proceedings of the IJCAI-01 Workshop on Stochastic Search, pages 43\u201347."},{"key":"38_CR3","unstructured":"Ruml, Wheeler. 2001c. Using prior knowledge with adaptive probing. In Carla Gomes and Toby Walsh, editors, Proceedings of the 2001 AAAI Fall Symposium on Using Uncertainity Within Computation, pages 116\u2013120. AAAI Technical Report FS-01-04."},{"key":"38_CR4","volume-title":"Technical Report TR-01-02","author":"R. Wheeler","year":"2002","unstructured":"Ruml, Wheeler. 2002. Heuristic search in bounded-depth trees: Best-leaf-first search. Technical Report TR-01-02, Harvard University, Cambridge, MA, January."},{"key":"38_CR5","unstructured":"Ruml, Wheeler. in preparation. Adaptive Tree Search. Ph.D. thesis, Harvard University."},{"key":"38_CR6","unstructured":"Ruml, Wheeler. to appear. Constructing distributed representations using additive clustering. In Advances in Neural Information Processing Systems 14 (NIPS-01). MIT Press."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45622-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T16:49:18Z","timestamp":1550335758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45622-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439417","9783540456223"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45622-8_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}