{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:19Z","timestamp":1750307959505,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273628","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"1047-1054","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["On learning linear ranking functions for beam search"],"prefix":"10.1145","author":[{"given":"Yuehua","family":"Xu","sequence":"first","affiliation":[{"name":"Oregon State University, Corvallis, OR"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Fern","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102373"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00034-3"},{"key":"e_1_3_2_1_4_1","unstructured":"Garey M. R. & Johnson D. S. (Eds.). (1979). Computers and intractability: A guide to the theory of np-completeness. New York: W. H. Freeman and Company.   Garey M. R. & Johnson D. S. (Eds.). (1979). Computers and intractability: A guide to the theory of np-completeness . New York: W. H. Freeman and Company."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1011"},{"volume-title":"Symposium on the Mathematical Theory of Automata (pp. 615--622)","year":"1962","author":"Novikoff A.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","unstructured":"Xu Y. Fern A. & Yoon S. (2007). Discriminative learning of beam-search heuristics for planning. IJCAI-07.   Xu Y. Fern A. & Yoon S. (2007). Discriminative learning of beam-search heuristics for planning. IJCAI-07 ."}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","sponsor":["Machine Learning Journal"],"location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07"},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273628","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:02Z","timestamp":1750258682000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":7,"alternative-id":["10.1145\/1273496.1273628","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273628","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}