{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T22:33:22Z","timestamp":1717454002639},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4557,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0004-3702(00)00072-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:57:34Z","timestamp":1027601854000},"page":"63-108","source":"Crossref","is-referenced-by-count":3,"title":["Optimal schedules for monitoring anytime algorithms"],"prefix":"10.1016","volume":"126","author":[{"given":"Lev","family":"Finkelstein","sequence":"first","affiliation":[]},{"given":"Shaul","family":"Markovitch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0004-3702(00)00072-2_ID003","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"Vol. 36","author":"Blumerand","year":"1989","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0004-3702(00)00072-2_ID004","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(94)90054-X","article-title":"Decision-theoretic deliberation scheduling for problem solving in time-constrained environments","volume":"Vol. 67","author":"Boddy","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00072-2_ID005","series-title":"Proc. 6th Conference on Uncertainty in Artificial Intelligence, Cambridge, MA","first-page":"129","article-title":"Ideal reformulation of belief networks","author":"Breese","year":"1990"},{"key":"10.1016\/S0004-3702(00)00072-2_ID006","series-title":"Algorithms for Minimization without Derivatives","author":"Brent","year":"1973"},{"key":"10.1016\/S0004-3702(00)00072-2_ID007","series-title":"Proc. AAAI-98, St. Paul, MN","first-page":"49","article-title":"An analysis of time-dependent planning","author":"Dean","year":"1988"},{"key":"10.1016\/S0004-3702(00)00072-2_ID008","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1613\/jair.487","article-title":"Integrative windowing","volume":"Vol. 8","author":"Fuernkranz","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(00)00072-2_ID009","series-title":"Foundations of Statistical Inference","first-page":"108","article-title":"Twenty-seven principles of rationality","author":"Good","year":"1971"},{"key":"10.1016\/S0004-3702(00)00072-2_ID010","series-title":"Proc. AAAI-96, Portland, OR","first-page":"1229","article-title":"Monitoring the progress of anytime problem-solving","author":"Hansen","year":"1996"},{"issue":"2","key":"10.1016\/S0004-3702(00)00072-2_ID011","doi-asserted-by":"crossref","DOI":"10.1145\/242587.242593","article-title":"Monitoring anytime algorithms","volume":"Vol. 7","author":"Hansen","year":"1997","journal-title":"SIGART Bulletin"},{"key":"10.1016\/S0004-3702(00)00072-2_ID012","series-title":"Proc. 1987 Workshop on Uncertainty in Artificial Intelligence, Seattle, WA","article-title":"Reasoning about beliefs and actions under computational resource constraints","author":"Horvitz","year":"1987"},{"key":"10.1016\/S0004-3702(00)00072-2_ID013","series-title":"Computation and action under bounded resources, Ph.D. Thesis","author":"Horvitz","year":"1990"},{"key":"10.1016\/S0004-3702(00)00072-2_ID014","series-title":"Proc. AAAI-97, Providence, RI","article-title":"Models of continual computation","author":"Horvitz","year":"1997"},{"key":"10.1016\/S0004-3702(00)00072-2_ID015","series-title":"Proc. IJCAI-89, Detroit, MI","first-page":"1121","article-title":"Reflection and action under scare resources: Theoretical principles and empirical study","author":"Horvitz","year":"1989"},{"key":"10.1016\/S0004-3702(00)00072-2_ID016","series-title":"Proc. 11th Conference on Uncertainty in Artificial Intelligence, Montreal, Quebec","article-title":"Reasoning, metareasoning, and mathematical truth: Studies of theorem proving under limited resources","author":"Horvitz","year":"1995"},{"key":"10.1016\/S0004-3702(00)00072-2_ID017","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","article-title":"An economic approach to hard computational problems","volume":"Vol. 275","author":"Huberman","year":"1997","journal-title":"Science"},{"key":"10.1016\/S0004-3702(00)00072-2_ID018","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"key":"10.1016\/S0004-3702(00)00072-2_ID019","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1613\/jair.509","article-title":"The divide-and-conquer subgoal-ordering algorithm for speeding up logic inference","volume":"Vol. 9","author":"Ledeniov","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(00)00072-2_ID020","series-title":"Proc. AAAI-98, Madison, WI","first-page":"463","article-title":"Learning investment functions for controlling the utility of control knowledge","author":"Ledeniov","year":"1998"},{"key":"10.1016\/S0004-3702(00)00072-2_ID021","series-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"Press","year":"1993"},{"key":"10.1016\/S0004-3702(00)00072-2_ID022","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"Vol. 1","author":"Quinlan","year":"1986","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(00)00072-2_ID023","series-title":"Proc. IJCAI-89, Detroit, MI","first-page":"334","article-title":"On optimal game-tree search using rational metareasoning","author":"Russell","year":"1989"},{"key":"10.1016\/S0004-3702(00)00072-2_ID024","series-title":"Do the Right Thing: Studies in Limited Rationality","author":"Russell","year":"1991"},{"key":"10.1016\/S0004-3702(00)00072-2_ID025","first-page":"55","article-title":"Rationality and intelligence","volume":"Vol. 4","author":"Russell","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00072-2_ID026","series-title":"Proc. IJCAI-91, Sydney, Australia","article-title":"Composing real-time systems","author":"Russell","year":"1991"},{"key":"10.1016\/S0004-3702(00)00072-2_ID027","doi-asserted-by":"crossref","first-page":"99","DOI":"10.2307\/1884852","article-title":"A behavioral model of rational choice","volume":"Vol. 69","author":"Simon","year":"1955","journal-title":"Quarterly J. Economics"},{"issue":"2","key":"10.1016\/S0004-3702(00)00072-2_ID028","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"Vol. 16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/S0004-3702(00)00072-2_ID029","series-title":"Operational rationality through compilation of anytime algorithms, Ph.D. Dissertation","author":"Zilberstein","year":"1993"},{"key":"10.1016\/S0004-3702(00)00072-2_ID030","series-title":"Proc. 1st International Conference on AI Planning Systems, College Park, MD","first-page":"260","article-title":"Efficient resource-bounded reasoning in AT-RALPH","author":"Zilberstein","year":"1992"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000722?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000722?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T06:19:44Z","timestamp":1578809984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0004370200000722"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00072-2","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}