University of Massachusetts Amherst
Department of Computer Science

 

 

CMPSCI 791F

Seminar in Resource-Bounded Reasoning

Fall 2002

 

Shlomo Zilberstein and Victor Lesser

 


Bibliography

  1. D.S. Bernstein, T.J. Perkins, S. Zilberstein, and L. Finkelstein. Scheduling contract algorithms on multiple processors, Proceedings of the 18th National Conference on Artificial Intelligence, 702-706, Edmonton, Alberta, 2002.

  2. M. Boddy and T. Dean. Decision-theoretic deliberation scheduling for problem solving in time-constrained environments, Artificial Intelligence, 67(2):245-286, 1994.

  3. V. Bultiko, I. levner, and R. Greiner. Real-time lookahead control policies, AAAI/KDD/UAI-2002 Joint Workshop on Real-Time Decision Support and Diagnosis Systems, 28-36, Edmonton, Alberta, 2002.

  4. P. Chakrabarti, S. Ghosh, and A. Acharya. Heuristic search in restricted memory, Artificial Intelligence, 47:197-221, 1989.

  5. A. Darwiche. Any-space probabilistic inference, Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, 133-142, Stanford, California, 2000.

  6. T. Dean and M. Boddy. An analysis of time-dependent planning, Proceedings of the 7th National Conference on Artificial Intelligence, 49-54, Minneapolis, Minnesota, 1988.

  7. T. 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. T. Dean, L. Kaelbling, J. Kirman, and A. Nicholson. Planning with deadlines in stochastic domains, Proceedings of the 11th National Conference on Artificial Intelligence, 574-579, Washington, D.C., 1993.

  9. K. Decker, V. Lesser, and R. Whitehair. Extending a blackboard architecture for approximate processing, Journal of Real-Time Systems, 2(1-2), 1990.

  10. S. de Givry and G. Verfaillie. Optimum anytime bounding for constraint optimization problems, AAAI Workshop on Building Resource-Bounded Reasoning Systems, 37-42, Providence, Rhode Island, 1997.

  11. A. Delhay, M. Dauchet, P. Taillibert, and P. Vanheeghe. Maximization of the average quality of anytime contract algorithms over a time interval, Proceedings of the 16th International Joint Conference on Artificial Intelligence, 212-217, Stockholm, Sweden, 1999.

  12. J. Doyle. Rationality and its roles in reasoning, Proceedings of the 8th National Conference on Artificial Intelligence, 1093-1100, Boston, Massachusetts, 1990.

  13. J. Doyle. Bounded rationality, In MIT Encyclopedia of the Cognitive Sciences, Cambridge: MIT Press, 1999.

  14. D.H. Dash and M.J. Druzdzel. A hybrid anytime algorithm for the construction of causal models from sparse data, Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence, 142-149, San Francisco, CA, 1999.

  15. L. Finkelstein and S. Markovitch Optimal schedules for monitoring anytime algorithms, Artificial Intelligence, 126(1-2):63-108, 2001.

  16. L. Finkelstein, S. Markovitch, and E. Rivlin Optimal schedules for parallelizing anytime algorithms: The case of independent processes, Proceedings of the 18th National Confernce on Artificial Intelligence, 719-724, Edmonton, Alberta, 2002.

  17. A. Garvey and V. Lesser. Design-to-time real-time scheduling, IEEE Transactions on Systems, Man and Cybernetics, 23(6):1491-1502, 1993.

  18. A. Garvey and V. Lesser. A survey of research in deliberative real-time artificial intelligence, Journal of Real-Time Systems, 6(3):317-347, 1994.

  19. Michael P. Georgeff and Francois F. Ingrand. Decision-making in an embedded reasoning system, Proceedings of the 11th International Joint Conference on Artificial Intelligence, 972-978, 1989.

  20. S. Ghosh, A. Mahanti, and D. Nau. BDFS: A resource bounded search procedure for combinatorial optimization problems, AAAI Fall Symposium on Flexible Computation in Intelligent Systems, 44-48, Boston, Massachusetts, 1996.

  21. Robert P. Goldman, David J. Musliner, and Kurt D. Krebsbach. Managing online self-adaptation in real-time environments, Proceedings of the Second International Workshop on Self-Adaptive Software, 2001.

  22. C.P. Gomes and B. Selman. Algorithm portfolio design: Theory vs. practice, Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, San Francisco, California, 1997.

  23. I. Good. Twenty-seven principles of rationality, In Godambe, V. P., and Sprott, D. A. (Eds.) Foundations of Statistical Inference, Toronto: Holt, Rinehart, Winston, 1971.

  24. J. Grass and S. Zilberstein. A value-driven system for autonomous information gathering, Journal of Intelligent Information Systems, 14:5-27, 2000.

  25. J. Grass and S. Zilberstein. Anytime algorithm development tools, In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):20-27, 1996.

  26. L. Greenwald and T. Dean. Solving time-critical decision-making problems with predictable computational demands, Proceedings of the Second International Conference on AI Planning Systems, 1994.

  27. H. Guo and W.H. Hsu. A survey of algorithms for real-time bayesian network inference, AAAI/KDD/UAI-2002 Joint Workshop on Real-Time Decision Support and Diagnosis Systems, 1-12, Edmonton, Alberta, 2002.

  28. P. 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.

  29. E. Hansen, A. Barto, and S. Zilberstein. Reinforcement learning for mixed open-loop and closed-loop control, Proceedings of Neural Information Processing Systems Conference, 1026-1032, Denver, Colorado, 1996.

  30. E. Hansen and S. Zilberstein. Monitoring the progress of anytime problem solving, Proceedings of the 13th National Conference on Artificial Intelligence, 1229-1234, Portland, Oregon, 1996.

  31. E. Hansen, S. Zilberstein, and V. Danilchenko. Anytime heuristic search: First results, University of Massachusetts, Computer Science Department, Technical Report #97-50, 1997.

  32. E. Hansen and S. Zilberstein. Monitoring and control of anytime algorithms: A dynamic programming approach, Artificial Intelligence, 126(1-2):139-158, 2001.

  33. O. Hansson and A. Mayer. Heuristic search as evidential reasoning, Proceedings of the 5th Workshop on Uncertainty in Artificial Intelligence, Windsor, Ontario, 1989.

  34. O. Hansson and A. Mayer. DTS: A decision-theoretic scheduler for space telescope applications, In M. Fox and M. Zweben (eds.), Intelligent Scheduling, Chapter 13, 371-388, Morgan Kaufmann, 1994.

  35. Barbara Hayes-Roth. Architectural foundations for real-time performance in intelligent agents, Journal of Real-Time Systems, 2(1-2), 1990.

  36. R. Holte, M. Perez, R. Zimmer, and A. MacDonald. The tradeoff between speed and optimality in hierarchical search, AAAI Fall Symposium on Flexible Computation in Intelligent Systems, 60-67, Boston, Massachusetts, 1996.

  37. B. Horling, V. Lesser, R. Vincent, and T. Wagner. The soft real-time agent control architecture, AAAI/KDD/UAI-2002 Joint Workshop on Real-Time Decision Support and Diagnosis Systems, Edmonton, Alberta, 2002.

  38. M.C. Horsch and D. Poole. An anytime algorithm for decision making under uncertainty, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, 246-255, Madison, Wisconsin, 1998.

  39. M.C. Horsch and D. Poole. Estimating the value of computation in flexible information refinement, Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, San Francisco, California, 1999.

  40. E.J. Horvitz. Reasoning under varying and uncertain resource constraints, Proceedings of the 7th National Conference on Artificial Intelligence, 111-116, 1988.

  41. E.J. Horvitz, G.F. Cooper, and D.E. Heckerman. Reflection and action under scarce resources: Theoretical principles and empirical study, Proceedings of the 11th International Joint Conference on Artificial Intelligence, 1121-1127, Detroit, Michigan, 1989.

  42. E.J. Horvitz, H.J. Suermondt, and G.F. Cooper. Bounded conditioning: Flexible inference for decision under scarce resources, Proceedings of the 5th Workshop on Uncertainty in Artificial Intelligence, 182-193, Windsor, Ontario. 1989

  43. E. Horvitz and J. Breese. Ideal partition of resources for metareasoning, Technical Report KSL-90-26, Stanford Knowledge Systems Laboratory, 1990.

  44. E.J. Horvitz and G. Rutledge. Time-dependent utility and action under uncertainty, Proceedings of 7th Conference on Uncertainty in Artificial Intelligence, 151-158, 1991.

  45. E. Horvitz and J. Lengyel. Perception, attention, and resources: A decision-theoretic approach to graphics rendering, Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, 238-249, 1997.

  46. E. Horvitz. Principles and applications of continual computation, Artificial Intelligence, 126(1-2):159-196, 2001.

  47. E. Horvitz, Y. Ruan, C. Gomes, H. Kautz, B. Selman, D. M. Chickering. A Bayesian approach to tackling hard computational problems, Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, August 2001.

  48. R. Howard. Information value theory, IEEE Transactions on System Science and Cybernetics, SSC-2(1):22-26, 1966.

  49. R. Jensen and J. Schlimmer. An anytime solution to inductively learn decision trees, AAAI Fall Symposium on Flexible Computation in Intelligent Systems, 106-110, Boston, Massachusetts, 1996.

  50. Nathalie Jitnah and Ann E. Nicholson. treeNets: A Framework for Anytime Evaluation of Belief Networks, ECSQARU-FAPR, 350-364, 1997.

  51. N. Jitnah and A.E. Nicholson. A best-first search method for anytime evaluation of belief networks, AAAI Workshop on Building Resource-Bounded Reasoning Systems, 69-73, Providence, Rhode Island, 1997.

  52. H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, B. Selman. Dynamic restart policies, Proceedings of the 18th National Conference on Artificial Intelligence, 674-681, Edmonton, Alberta, 2002.

  53. R. Korf. Real-time heuristic search, Artificial Intelligence, 42(3):189-212, 1990.

  54. M. Lagoudakis, M. Littman, and R. Parr. Selecting the right algorithm, AAAI Fall Symposium Series: Using Uncertainty within Computation, Cape Cod, MA, 2001.

  55. Kate Larson and Tuomas Sandholm. Bargaining with limited computation: deliberation equilibrium, Artificial Intelligence, 132(2):183-217, 2001.

  56. Kate Larson and Tuomas Sandholm. An alternating offers bargaining model for computationally limited agents, Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems, Bologna, Italy, 2002.

  57. V. Lesser, J. Pavlin and E. Durfee. Approximate processing in real-time problem-solving, Artificial Intelligence Magazine, 9(1):49-61, 1988.

  58. C.-L. Liu and M. 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.

  59. R. Mailler and V. Lesser. Cooperative negotiation for optimized distributed resource allocation in soft real-time, 2002.

  60. M. Marengoni, A. Hanson, S. Zilberstein, and E. Riseman. Control in a 3D reconstruction system using selective perception, Proceedings of the 7th IEEE International Conference on Computer Vision, 1229-1236, Kerkyra, Greece, 1999.

  61. A.-I. Mouaddib and S. Zilberstein. Optimal scheduling of dynamic progressive processing, Proceedings of the 13th Biennial European Conference on Artificial Intelligence, 449-503, Brighton, UK, 1998.

  62. David J. Musliner. Imposing real-time constraints on self-adaptive controller synthesis, Proceedings of the International Workshop on Self-Adaptive Software, 2000.

  63. D.J. Musliner, E.H. Durfee, and K.G. Shin. CIRCA: A cooperative intelligent real time control architecture, IEEE Transactions on Systems, Man, and Cybernetics, 23(6):1561-1574, 1993.

  64. S.H. Nawab, A.V. Oppenheim, A.P. Chandrakasan, J.M. Winograd, and J.T. Ludwig. Approximate signal processing, Journal of VLSI Signal Processing, 15:177-200, 1997.

  65. J. Pemberton. k-best: A new method for real-time decision making, Proceedings of the 14th International Joint Conference on Artificial Intelligence, 227-233, Montreal, Canada, 1995.

  66. A. Pos. Time-constrained model-based diagnosis, Master Thesis, Department of Computer Science, University of Twente, The Netherlands, 1993.

  67. S. Raman and B. Wah. Quality-time tradeoffs in simulated annealing for VLSI placement, Proceedings of the 15th International Computer Software and Applications Conference, 1991.

  68. F.T. Ramos, F.G. Cozman, and J.S. Ide. Embedded Bayesian networks: Anyspace, anytime probabilistic inference, AAAI/KDD/UAI-2002 Joint Workshop on Real-Time Decision Support and Diagnosis Systems, 13-19, Edmonton, Alberta, 2002.

  69. S. Russell. Efficient memory-bounded search methods, Proceedings of the 10th European Conference on Artificial Intelligence, 1-5, Vienna, Austria, 1992.

  70. S. Russell. Rationality and intelligence, Artificial Intelligence, 94(1):57-77, 1997.

  71. S. Russell, D. Subramanian, and R. Parr Provably bounded optimal agents, Proceedings of the 13th International Joint Conference on Artificial Intelligence, 338-344, 1993.

  72. S. Russell and D. Subramanian. Provably bounded-optimal agents, Journal of Artificial Intelligence Research, 2, 1995.

  73. S. Russell and E. Wefald. Do the Right Thing: Studies in limited rationality, Cambridge, Massachusetts: MIT Press, 1991.

  74. S. Russell and E. Wefald. Principles of metareasoning, Artificial Intelligence, 49:361-395, 1991.

  75. T.W. Sandholm and V.R. Lesser. Coalitions among computationally bounded agents, Artificial Intelligence, 94(1):99-137, 1997.

  76. B. Selman and S. Kirkpatrick. Critical behavior in the computational cost of satisfiability testing, Artificial Intelligence, 81:273-295, 1996.

  77. S. Shekhar and S. Dutta. Minimizing response times in real time planning and search, Proceedings of the 11th International Joint Conference on Artificial Intelligence, 238--242, 1989.

  78. Reid Simmons. Concurrent planning and execution for autonomous robots, IEEE Control Systems, 12(1):46-50, 1992

  79. Reid Simmons. Structured control for autonomous robots, IEEE Transactions on Robotics and Automation, 10(1):34-43, 1994.

  80. R. Simmons and D. Apfelbaum. A task description language for robot control, Proceedings of Conference on Intelligent Robotics and Systems, 1998.

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

  82. P. Smyth and D. Wolpert. Anytime exploratory data analysis for massive data sets, Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, 54-60, 1997.

  83. L. Steinberg. Searching stochastically generated multi-abstraction-level design spaces, Artificial Intelligence, 129(1-2):63-90, 2001.

  84. K. Toyama. Handling tradeoffs between precision and robustness with incremental focus of attention for visual tracking, AAAI Fall Symposium on Flexible Computation in Intelligent Systems, 142-147, Boston, Massachusetts, 1996.

  85. S.V. Vrbsky and J.W.S. Liu. APPROXIMATE -- A query processor that produces monotonically improving approximate answers, IEEE Transactions on Knowledge and Data Engineering, 5(6):1056-1068, 1993.

  86. T. Wagner, A. Garvey, and V. Lesser. Criteria directed task scheduling, Journal of Approximate Reasoning, 19:91-118, 1998.

  87. T. Wagner, A. Raja, and V. Lesser. Modeling uncertainty and its implications to design-to-criteria scheduling, 2002.

  88. R. Wallace and E. 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.

  89. W. Ruml. Real-time heuristic search for combinatorial optimization and constraint satisfaction, AAAI/KDD/UAI-2002 Joint Workshop on Real-Time Decision Support and Diagnosis Systems, 85-90, Edmonton, Alberta, 2002.

  90. Michael P. Wellman and Chao-Lin Liu. State-Space Abstraction for Anytime Evaluation of Probabilistic Networks, Conference on Uncertainty in Artificial Intelligence, 567-574, 1994.

  91. W. Zhang. Flexible and approximate computation through state-space reduction, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, 531-538, Madison, Wisconsin, 1998.

  92. W. Zhang. Complete anytime beam search, Proceedings of the 15th National Conference on Artificial Intelligence, 425-430, Madison, Wisconsin, 1998.

  93. W. Zhang. Iterative state-space reduction for flexible computation, Artificial Intelligence, 126(1-2):109-138, 2001.

  94. F. Zhao, J. Shin, and J. Reich. Information-driven dynamic sensor collaboration for tracking applications, IEEE Signal Processing Magazine, March, 2002.

  95. S. Zilberstein. Resource-bounded sensing and planning in autonomous systems, Autonomous Robots, 3:31-48, 1996.

  96. S. Zilberstein. Using anytime algorithms in intelligent systems, Artificial Intelligence Magazine, 17(3):73-83, 1996.

  97. S. Zilberstein and S. Russell. Optimal composition of real-time systems, Artificial Intelligence, 82(1-2):181-213, 1996.

  98. S. Zilberstein, F. Charpillet, and P. Chassaing. Real-time problem-solving with contract algorithms, Proceedings of the 16th International Joint Conference on Artificial Intelligence, 1268-1273, Stockholm, Sweden, 1999.

  99. S. Zilberstein and A.-I. Mouaddib. Optimizing resource utilization in planetary rovers, Proceedings of the 2nd NASA International Workshop on Planning and Scheduling for Space, 163-168, San Francisco, California, 2000.

  100. S. Zilberstein, R. Washington, D.S. Bernstein, and A.I. Mouaddib. Decision-theoretic control of planetary rovers, To appear in Springer LNAI, 2002.

  101. M. Zweben, E. Davis and R. Guargan. Anytime rescheduling, Proceedings of DARPA Workshop on Innovative Approach for Planning and Scheduling, 251-259, San Francisco, 1990.


© 2002 Shlomo Zilberstein.