UNIVERSITY OF MASSACHUSETTS
Computer Science Department

 

 

CMPSCI 791T

Resource-Bounded Reasoning Techniques

Spring 1997

 

Shlomo Zilberstein

 

 

Bibliography

  1. Mark Boddy and Thomas Dean. Decision-Theoretic Deliberation Scheduling for Problem Solving in Time-Constrained Environments. Artificial Intelligence, 67(2):245-286, 1994.

  2. Craig Boutilier and Richard Dearden. Using Abstraction for Decision-Theoretic Planning with Time Constraints. Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 1016-1022, Seattle, Washington, 1994.

  3. Francois Charpillet and Anne Boyer. Composing and Monitoring Non-Deterministic Design-to-time Methods. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 11-18, Boston, Massachusetts, 1996.

  4. Bruce D'Ambrosio and Scott Burgess. Some Experiments with Real-Time Decision Algorithms. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 25-32, Boston, Massachusetts, 1996.

  5. P. Chakrabarti, S. Ghosh, and A. Acharya. Heuristic Search in Restricted Memory. Artificial Intelligence, 47:197-221, 1989.

  6. Thomas Dean and Mark Boddy. An Analysis of Time-Dependent Planning. Proceedings of the Seventh National Conference on Artificial Intelligence, pp. 49-54, Minneapolis, Minnesota, 1988.

  7. Thomas Dean. Context-Dependent Computational Components, In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):3-6, 1996.

  8. Thomas Dean, Leslie Kaelbling, Jak Kirman and Ann Nicholson. Planning with Deadlines in Stochastic Domains. Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 574-579, Washington, D.C., 1993.

  9. Jon Doyle. Rationality and its Roles in Reasoning. Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 1093-1100, Boston, Massachusetts, 1990.

  10. Mark Drummond, John Bresina and Keith Swanson. Just-In-Case Scheduling. Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 1098-1104, Seattle, Washington, 1994.

  11. Jean-Michel Gallone, Francois Charpillet and and Frederic Alexandre. Anytime Scheduling with Neural Networks. Proceedings of the IEEE International Conference on Emerging technologies and Factory Automation, pp. ??-??, Paris, 1995.

  12. Alan Garvey and Victor Lesser. Design-to-time Real-Time Scheduling. IEEE Transactions on Systems, Man and Cybernetics, 23(6):1491-1502, 1993.

  13. Alan Garvey and Victor Lesser. A Survey of Research in Deliberative Real-Time Artificial Intelligence. Journal of Real-Time Systems, 6(3):317-347, 1994.

  14. Alan Garvey and Victor Lesser. Issues in Design-to-time Real-Time Scheduling. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 38-43, Boston, Massachusetts, 1996.

  15. Subrata Ghosh, Ambuj Mahanti and Dana Nau. BDFS: A Resource Bounded Search Procedure for Combinatorial Optimization Problems. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 44-48, Boston, Massachusetts, 1996.

  16. Irving Good. Twenty-Seven Principles of Rationality. In Godambe, V. P., and Sprott, D. A. (Eds.) Foundations of Statistical Inference, Toronto: Holt, Rinehart, Winston, 1971.

  17. Joshua Grass and Shlomo Zilberstein. Anytime Algorithm Development Tools. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):20-27, 1996.

  18. Joshua Grass and Shlomo Zilberstein. Value-Driven Information Gathering. Submitted for publication, 1997.

  19. Lloyd Greenwald and Thomas Dean. Solving Time-Critical Decision-Making Problems with Predictable Computational Demands. Proceedings of the Second International Conference on AI Planning Systems, 1994.

  20. Peter Haddawy. Focusing Attention in Anytime Decision-Theoretic Planning. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):34-40, 1996.

  21. Eric Hansen, Andrew Barto, and Shlomo Zilberstein. Reinforcement Learning for Mixed Open-loop and Closed-loop Control. Proceedings of Neural Information Processing Systems Conference, Denver, Colorado, 1996.

  22. Eric Hansen and Shlomo Zilberstein. Monitoring the Progress of Anytime Problem Solving. Proceedings of the 13th National Conference on Artificial Intelligence, pp. 1229-1234, Portland, Oregon, 1996.

  23. Eric Hansen, Shlomo Zilberstein, and Victor Danilchenko. Anytime Heuristic Search: First Results. Submitted for publication, 1997.

  24. Othar Hansson and Andrew Mayer. Heuristic Search as Evidential Reasoning. Proceedings of the 5th Workshop on Uncertainty in AI, Windsor, Ontario, 1989.

  25. Othar Hansson and Andrew Mayer. Decision-Theoretic Planning in BPS. In Proceedings of the AAAI Spring Symposium on Planning in Uncertain Environments, Palo Alto, California, 1990.

  26. Robert Holte, Maria Perez, Robert Zimmer, and Alan MacDonald. The Tradeoff Between Speed and Optimality in Hierarchical Search. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 60-67, Boston, Massachusetts, 1996.

  27. Michael Horsch and David Poole. Flexible Policy Construction by Information Refinement. Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, pp. 315-324, Portland, Oregon, 1996.

  28. Eric Horvitz. From Idling to Activity: Models of Continual Computation in Automated Problem Solving. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 73-80, Boston, Massachusetts, 1996.

  29. Eric Horvitz and Jed Langyel. Flexible Rendering of 3D Graphics under Varying Resources. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 81-88, Boston, Massachusetts, 1996.

  30. Eric Horvitz and Jack Breese. Ideal Partition of Resources for Metareasoning. Technical Report KSL-90-26, Stanford Knowledge Systems Laboratory, 1990.

  31. Horvitz, E. J.; Suermondt, H. J.; and Cooper, G. F. Bounded Conditioning: Flexible Inference for Decision under Scarce Resources. Proceedings of the 1989 Workshop on Uncertainty in Artificial Intelligence, pp. 182-193, Windsor, Ontario. 1989

  32. Ronald Howard. Information Value Theory. IEEE Transactions on System Science and Cybernetics, SSC-2(1):22-26, 1966.

  33. Richard Jensen and Jeffrey Schlimmer. An Anytime Solution to Inductively Learn Decision Trees. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 106-110, Boston, Massachusetts, 1996.

  34. Craig Knoblock. Search Reduction in Hierarchical Problem Solving. Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 686-691, Anaheim, California, 1991.

  35. Daphne Koller. Evidence-directed Belief Network Simplification. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 117-120, Boston, Massachusetts, 1996.

  36. Richard Korf. Real-Time Heuristic Search. Artificial Intelligence, 42(3):189-212, 1990.

  37. Victor Lesser, J. Pavlin and E. Durfee. Approximate Processing in Real-Time Problem-Solving. AI Magazine, 9(1):49-61, 1988.

  38. Victor Lesser, Hamid Nawab and Frank Klassner. IPUS: An Architecture for Integrated Signal Processing and Signal Understanding. Artificial Intelligence, 77(1):129-171, 1995.

  39. Chao-Lin Liu and Michael Wellman. On State-Space Abstraction for Anytime Evaluation of Bayesian Networks. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):50-57, 1996.

  40. J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung and W. Zhao. Algorithms for Scheduling Imprecise Computations. IEEE Computer, 24:58-68, 1991.

  41. Abdel-illah Mouaddib and Shlomo Zilberstein. Knowledge-Based Anytime Computation. Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 775-781, Montreal, Canada, 1995.

  42. Abdel-illah Mouaddib and Francois Charpillet. Progressive Reasoning for Real-Time Problem Solving. IEEE TRansactions on Systems, Man and Cybernetics, to appear, 1997.

  43. Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Los Altos, California: Morgan-Kaufmann, 1988.

  44. Joseph Pemberton. k-best: A New Method for Real-Time Decision Making. Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 227-233, Montreal, Canada, 1995.

  45. Joseph Pemberton and Richard Korf. Incremental Search Algorithms for Real-Time Decision Making. Proceedings of the Second International Conference on AI Planning Systems, Chicago, Illinois, 1994.

  46. Anita Pos. Time-Constrained Model-Based Diagnosis. Master Thesis, Department of Computer Science, University of Twente, The Netherlands, 1993.

  47. Stuart Russell. Efficient Memory-Bounded Search Methods. Proceedings of the Tenth European Conference on Artificial Intelligence, pp. 1-5, Vienna, Austria, 1992.

  48. Stuart Russell and Devika Subramanian. Provably Bounded-Optimal Agents. Journal of Artificial Intelligence Research, 2, 1995.

  49. Stuart Russell and Eric Wefald. On optimal game-tree search using rational meta-reasoning. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 334-340, Detroit, Michigan, 1989.

  50. Stuart Russell and Eric Wefald. Do the Right Thing: Studies in limited rationality. Cambridge, Massachusetts: MIT Press, 1991.

  51. Stuart Russell and Eric Wefald. Principles of Metareasoning. Artificial Intelligence, 49:361-395, 1991.

  52. Geoffrey Rutledge. Model Selection Under Time Constraints. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 134-141, Boston, Massachusetts, 1996.

  53. Bart Selman and Scott Kirkpatrick. Critical Behavior in the Computational Cost of Satisfiability Testing. Artificial Intelligence, 81:273-295, 1996.

  54. Herbert Simon. From substantive to procedural rationality. In Herbert Simon, Models of Bounded Rationality, Volume 2. Cambridge, Massachusetts: MIT Press, 1982.

  55. Jonathan Tash and Stuart Russell. Control Strategies for a Stochastic Planner. Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 1079-1085, Seattle, Washington, 1994.

  56. Kentaro Toyama. Handling Tradeoffs between Precision and Robustness with Incremental Focus of Attention for Visual Tracking. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 142-147, Boston, Massachusetts, 1996.

  57. S. V. Vrbsky, J. W. S. Liu and K. P. Smith. An Object-Oriented Query Processor That Returns Monotonically Improving Approximate Answers. Technical Report UIUCDCS-R-90-1568, University of Illinois at Urbana-Champaign, 1990.

  58. Richard Wallace and Eugene Freuder. Anytime Algorithms for Constraint Satisfaction and SAT Problems. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):7-10, 1996.

  59. Joseph Winograd, Jeffrey Ludwig, Hamid Nawab, Alan Oppenheim and Anantha Chandrakasan. Flexible Systems for Digital Signal Processing. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 156-159, Boston, Massachusetts, 1996.

  60. John Zelek. Performing Concurrent Robot Path Execution and Computation in Real-Time. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 160-167, Boston, Massachusetts, 1996.

  61. Weixiong Zhang. State-Space Reduction for Flexible and Approximate Computation. AAAI Fall Symposium on Flexible Computation in Intelligent Systems, pp. 168-175, Boston, Massachusetts, 1996.

  62. Shlomo Zilberstein. Optimizing Decision Quality with Contract Algorithms. Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 1576-1582, Montreal, Canada, 1995.

  63. Shlomo Zilberstein. Resource-Bounded Sensing and Planning in Autonomous Systems. Autonomous Robots, 3:31-48, 1996.

  64. Shlomo Zilberstein. Using Anytime Algorithms in Intelligent Systems. AI Magazine, 17(3):73-83, 1996.

  65. Shlomo Zilberstein and Victor Lesser. Intelligent Information Gathering Using Decision Models. Technical Report 96-35, Computer Science Department, University of Massachusetts, 1996.

  66. Shlomo Zilberstein and Stuart Russell. Optimal Composition of Real-Time Systems. Artificial Intelligence, 82(1-2):181-213, 1996.


shlomo@cs.umass.edu