Optimal schedules for monitoring anytime algorithms

Artificial Intelligence

Volumn 126, Issue 1-2, 2001, Pages 63-108

  Finkelstein, Lev ^a   Markovitch, Shaul ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; MATHEMATICAL MODELS; QUEUEING THEORY; THEOREM PROVING;

ANYTIME ALGORITHMS; META-REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0035250751     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00072-2     Document Type: Article

References (28)

1. Blumerand A., Ehrenfeucht A., Haussler D., Warmuth M.K. Learnability and the Vapnik-Chervonenkis dimension. J. ACM. Vol. 36:(4):1989;929-965.
2. Boddy M., Dean T. Decision-theoretic deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence. Vol. 67:(2):1994;245-286.
3. Breese J.S., Horvitz E.J. Ideal reformulation of belief networks. Proc. 6th Conference on Uncertainty in Artificial Intelligence, Cambridge, MA. 1990;129-143.
4. Brent R.P. Algorithms for Minimization without Derivatives. 1973;Prentice Hall, Englewood Cliffs, NJ.
5. Dean T., Boddy M. An analysis of time-dependent planning. Proc. AAAI-98, St. Paul, MN. 1988;49-54.
6. Fuernkranz J. Integrative windowing. J. Artificial Intelligence Res. Vol. 8:1998;129-164.
7. Good I.J. Twenty-seven principles of rationality. Godambe V.P., Sprott D.A. Foundations of Statistical Inference. 1971;108-141 Holt, Rinehart, Winston, Toronto.
8. Hansen E.A., Zilberstein S. Monitoring the progress of anytime problem-solving. Proc. AAAI-96, Portland, OR. 1996;1229-1234.
9. Hansen E.A., Zilberstein S. Monitoring anytime algorithms. SIGART Bulletin. Vol. 7:(2):1997.
10. Horvitz E.J. Reasoning about beliefs and actions under computational resource constraints. Proc. 1987 Workshop on Uncertainty in Artificial Intelligence, Seattle, WA. 1987.
11. Horvitz E.J. Computation and action under bounded resources, Ph.D. Thesis. 1990;Stanford University.
12. Horvitz E.J. Models of continual computation. Proc. AAAI-97, Providence, RI. 1997.
13. Horvitz E.J., Cooper C.F., Heckerman D.E. Reflection and action under scare resources: Theoretical principles and empirical study. Proc. IJCAI-89, Detroit, MI. 1989;1121-1127.
14. Horvitz E., Klein A. Reasoning, metareasoning, and mathematical truth: Studies of theorem proving under limited resources. Proc. 11th Conference on Uncertainty in Artificial Intelligence, Montreal, Quebec. 1995.
15. Huberman B.A., Lukose R.M., Hogg T. An economic approach to hard computational problems. Science. Vol. 275:1997;51-53.
16. Kearns M.J., Vazirani U.V. An Introduction to Computational Learning Theory. 1994;MIT Press, Cambridge, MA.
17. Ledeniov O., Markovitch S. The divide-and-conquer subgoal-ordering algorithm for speeding up logic inference. J. Artificial Intelligence Res. Vol. 9:1998;37-97.
18. Ledeniov O., Markovitch S. Learning investment functions for controlling the utility of control knowledge. Proc. AAAI-98, Madison, WI. 1998;463-468.
19. Press W.H., Teukolsky S.A., Vetterling W.T., Flannery B.P. Numerical Recipes in C: The Art of Scientific Computing. 1993;Cambridge University Press, Cambridge, UK.
20. Quinlan J.R. Induction of decision trees. Machine Learning. Vol. 1:1986;81-106.
21. Russell S., Wefald E. On optimal game-tree search using rational metareasoning. Proc. IJCAI-89, Detroit, MI. 1989;334-340.
22. Russell S., Wefald E. Do the Right Thing: Studies in Limited Rationality. 1991;MIT Press, Cambridge, MA.
23. Russell S.J. Rationality and intelligence. Artificial Intelligence. Vol. 4:1997;55-77.
24. Russell S.J., Zilberstein S. Composing real-time systems. Proc. IJCAI-91, Sydney, Australia. 1991;Morgan Kaufmann, San Mateo, CA.
25. Simon H.A. A behavioral model of rational choice. Quarterly J. Economics. Vol. 69:1955;99-118.
26. Vapnik V.N., Chervonenkis A.Y. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. Vol. 16:(2):1971;264-280.
27. Zilberstein S. Operational rationality through compilation of anytime algorithms, Ph.D. Dissertation. 1993;Computer Science Division, University of California, Berkeley, CA.
28. Zilberstein S., Russell S.J. Efficient resource-bounded reasoning in AT-RALPH. Proc. 1st International Conference on AI Planning Systems, College Park, MD. 1992;260-266.