2007

• Using Abstraction for Generalized Planning.
  S. Srivastava, N. Immerman, and S. Zilberstein. ICAPS Workshop on Artificial Intelligence Planning and Learning, Providence, Rhode Island, 2007, [abs] [pdf]

• Learning to Communicate in a Decentralized Environment.
  C. V. Goldman, M. Allen, and S. Zilberstein. Autonomous Agents and Multi-Agent Systems, 15(1):47-90, 2007. [abs] [pdf]

• Anytime Coordination Using Separable Bilinear Programs.
  M. Petrik and S. Zilberstein. Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI), Vancouver, British Columbia, 2007. [abs] [pdf]

• Agent Influence as a Predictor of Difficulty for Decentralized Problem-Solving.
  M. Allen and S. Zilberstein. Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI), Vancouver, British Columbia, 2007. [abs] [pdf]

• Optimizing Memory-Bounded Controllers for Decentralized POMDPs.
  C. Amato, D.S. Bernstein, and S. Zilberstein. Proceedings of the Twenty Third Conference on Uncertainty in Artificial Intelligence (UAI), Vancouver, British Columbia, 2007. [abs] [pdf]

• Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs.
  S. Seuken and S. Zilberstein. Proceedings of the Twenty Third Conference on Uncertainty in Artificial Intelligence (UAI), Vancouver, British Columbia, 2007. [abs] [pdf]

• Bounded Dynamic Programming for Decetralized POMDPs.
  C. Amato, A. Carlin, and S. Zilberstein. AAMAS 2007 Workshop on Multi-Agent Sequential Decision Making in Uncertain Domains, Honolulu, Hawaii, May, 2007. [abs] [pdf]

• Solving POMDPs Using Quadratically Constrained Linear Programs.
  C. Amato, D.S. Bernstein, and S. Zilberstein. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI), 2418-2424, Hyderabad, India, 2007. [abs] [pdf]

• Web Page Clustering using Heuristic Search in the Web Graph.
  R. Bekkerman, S. Zilberstein, and J. Allan. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI), 2280-2285, Hyderabad, India, 2007. [abs] [pdf]

• Average-Reward Decentralized Markov Decision Processes.
  M. Petrik and S. Zilberstein. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI), 1997-2002, Hyderabad, India, 2007. [abs] [pdf]

• Memory-Bounded Dynamic Programming for DEC-POMDPs.
  S. Seuken and S. Zilberstein. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI), 2009-2015, Hyderabad, India, 2007. [abs] [pdf]

• Learning Parallel Portfolios of Algorithms.
  M. Petrik and S. Zilberstein. Annals of Mathematics and Artificial Intelligence, 48(1-2):85-106, 2006. [abs] [pdf]

• Annals of Artificial Intelligence and Mathematics Special Issue.
  Selected Papers from the Ninth International Symposium on Artificial Intelligence and Mathematics, S. Zilberstein (editor), Volume 47(3-4), 2006. [contents]

• Finding Optimal POMDP Controllers Using Quadratically Constrained Linear Programs.
  C. Amato, D.S. Bernstein, and S. Zilberstein. Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics (AI&MATH), Ft. Lauderdale, Florida, 2006. [abs] [pdf]

• Learning Static Parallel Portfolios of Algorithms.
  M. Petrik and S. Zilberstein. Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics (AI&MATH), Ft. Lauderdale, Florida, 2006. [abs] [pdf]

• Optimal Fixed-Size Controllers for Decentralized POMDPs.
  C. Amato, D.S. Bernstein, and S. Zilberstein. AAMAS 2006 Workshop on Multi-Agent Sequential Decision Making in Uncertain Domains, Hakodate, Japan, May, 2006. [abs] [pdf]

• Learning Policies for Sequential Time and Cost Sensitive Classification.
  A. Arnt and S. Zilberstein. KDD 2005 Workshop on Utility-Based Data Mining, Chicago, Illinois, 2005. [abs] [pdf]

• Analyzing Myopic Approaches for Multi-Agent Communication.
  R. Becker, V. Lesser, and S. Zilberstein. Proceedings of Intelligent Agent Technology (IAT), Compiègne, France, 2005. (Best Paper Award) [abs] [pdf]

• Bounded Policy Iteration for Decentralized POMDPs.
  D.S. Bernstein, E.A. Hansen, and S. Zilberstein. Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, 2005. [abs] [pdf]

• Language Learning in Multi-Agent Systems.
  M. Allen, C.V. Goldman, and S. Zilberstein. Poster presented at the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, 2005. [abs] [pdf]

• MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs.
  D. Szer, F. Charpillet, and S. Zilberstein. Proceedings of the Twenty First Conference on Uncertainty in Artificial Intelligence (UAI), Edinburgh, Scotland, 2005. [abs] [pdf]

• Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains.
  N. Beliaeva and S. Zilberstein. Proceedings of the Symposium on Abstraction, Reformulation, and Approximation (SARA), Airth Castle, Scotland, 2005. [abs] [pdf]

• Efficient Maximization in Solving POMDPs.
  Z. Feng and S. Zilberstein. Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI), Pittsburgh, Pennsylvania, 2005. [abs] [pdf]

• Learning to Communicate in Decentralized Systems.
  M. Allen, C.V. Goldman, and S. Zilberstein. Eighth Binennial Israeli Symposium on the Foundations of AI (BISFAI), Haifa, Israel, 2005. [abs] [pdf]

• Solving Transition-Independent Decentralized Markov Decision Processes.
  R. Becker, S. Zilberstein, V. Lesser, and C.V. Goldman. Journal of Artificial Intelligence Research, 22:423-455, 2004. [abs] [pdf]

• Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis.
  C.V. Goldman and S. Zilberstein. Journal of Artificial Intelligence Research, 22:143-174, 2004. [abs] [pdf]

• Heuristic-Guided Counterexample Search in FLAVERS.
  J. Tan, G.S. Avrunin, L.A. Clarke, S. Zilberstein, and S. Leue. Proceedings of ACM SIGSOFT 2004/FSE-12, Newport Beach, California, 2004. [abs] [pdf]

• Dynamic Composition of Information Retrieval Techniques.
  A. Arnt, S. Zilberstein, J. Allan, and A.I. Mouaddib. Journal of Intelligent Information Systems, 23(1):67-97, 2004. [abs] [pdf]

• Dynamic Programming for Partially Observable Stochastic Games.
  E.A. Hansen, D.S. Bernstein, and S. Zilberstein. Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI), San Jose, California, 2004. [abs] [pdf]

• Decentralized Markov Decision Processes with Event-Driven Interactions.
  R. Becker, S. Zilberstein, and V. Lesser. Proceedings of the Third International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS), New York City, 2004. [abs] [pdf]

• Decentralized Language Learning Through Acting.
  C.V. Goldman, M. Allen, and S. Zilberstein. Proceedings of the Third International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS), New York City, 2004. [abs] [pdf]

• Region-Based Incremental Pruning for POMDPs.
  Z. Feng and S. Zilberstein. Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI), Banff, Canada. 2004. [abs] [pdf]

• Automated Conversion and Simplification of Plan Representations.
  M. Allen and S. Zilberstein. ICAPS 2004 Workshop on Connecting Planning Theory with Practice. [abs] [pdf]

• Optimal Decisions with Continuous Actions.
  L. Jeanpierre, S. Zilberstein, and F. Charpillet. Jurnées Nationales sur Processus Décisionnel de Markov et Intelligence Artificielle. [abs] [pdf]

• Attribute Measurement Policies for Cost-Effective Classification.
  A. Arnt and S. Zilberstein. SIAM/SDM Workshop on Data Mining in Resource Constrained Environments, Lake Buena Vista, Florida, 2004. [abs] [pdf]

• Dynamic Programming for Decentralized POMDPs.
  D.S. Bernstein, E.A. Hansen, S. Zilberstein, and C. Amato. AAAI Spring Symposium on Bridging the Multi-Agent and Multi-Robot Research Gap, Stanford, California, 2004. [abs] [pdf]

• Optimal Sequencing of Contract Algorithms.
  S. Zilberstein, F. Charpillet, and P. Chassaing. Annals of Mathematics and Artificial Intelligence, 39(1-2):1-18, 2003. [abs] [pdf]

• Decision Making and Uncertainty Management in a 3D Reconstruction System.
  M. Marengoni, A. Hanson, S. Zilberstein, and E. Riseman. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(7):852-858, 2003. [abs] [pdf]

• Symbolic Generalization for On-line Planning.
  Z. Feng, E.A. Hansen, and S. Zilberstein. Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI), Acapulco, Mexico, 2003. [abs] [pdf]

• Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems.
  D.S. Bernstein, L. Finkelstein, and S. Zilberstein. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003. [abs] [pdf]

• Automated Generation of Understandable Contingency Plans.
  M. Horstmann and S. Zilberstein. Poster presented at the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003. [abs] [pdf]

• Transition-Independent Decentralized Markov Decision Processes.
  R. Becker, S. Zilberstein, V. Lesser, and C.V. Goldman. Proceedings of the Second International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), Melbourne, Australia, 2003. (Best Paper Award) [abs] [pdf]

• Optimizing Information Exchange in Cooperative Multi Agent Systems.
  C.V. Goldman and S. Zilberstein. Proceedings of the Second International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), Melbourne, Australia, 2003. [abs] [pdf]

• Adaptive Peer Selection.
  D.S. Bernstein, Z. Feng, B. Levine, and S. Zilberstein. Proceedings of the Second International Workshop on Peer-to-Peer Systems, Berkeley, California, 2003. [abs] [pdf]

• Symbolic Real-Time Dynamic Programming.
  Z. Feng, S. Zilberstein, and E.A. Hansen. IJCAI Workshop on Model Checking and Artificial Intelligence, Acapulco, Mexico, 2003. [abs] [pdf]

• Mechanism Design for Communication in Cooperative Systems.
  C.V. Goldman and S. Zilberstein. Fifth Workshop on Game Theoretic and Decision Theoretic Agents, Melbourne, Australia, 2003. [abs] [pdf]

• Automated Generation of Understandable Contingency Plans.
  M. Horstmann and S. Zilberstein. ICAPS Workshop on Planning Under Uncertainty and Incomplete Information, Trento, Italy, June 2003. [abs] [pdf]

• Scheduling Contract Algorithms on Multiple Processors
  D.S. Bernstein, T.J. Perkins, S. Zilberstein, and L. Finkelstein. Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), Edmonton, Alberta, Canada, 2002. [abs] [pdf]

• The Complexity of Decentralized Control of Markov Decision Processes.
  D.S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. Mathematics of Operations Research, 27(4):819-840, 2002. [abs] [pdf]

• Decision-Theoretic Control of Planetary Rovers
  S. Zilberstein, R. Washington, D.S. Bernstein, and A.I. Mouaddib. In M. Beetz et al. (Eds.), Plan-Based control of Robotic Agents, LNAI, No. 2466, 270-289, 2002. [abs] [pdf]

• LAO*: A Heuristic Search Algorithm that Finds Solutions with Loops
  E.A. Hansen and S. Zilberstein. Artificial Intelligence, 129(1-2):35-62, 2001. [abs] [pdf]

• Monitoring and Control of Anytime Algorithms: A Dynamic Programming Approach
  E.A. Hansen and S. Zilberstein. Artificial Intelligence, 126(1-2):139-157, 2001. [abs] [pdf]

• Adaptive Control of Acyclic Progressive Processing Task Structures
  S. Cardon, A.I. Mouaddib, S. Zilberstein, and R. Washington. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), Seattle, Washington, 2001. [abs] [pdf]

• Communication Decisions in Multi-agent Cooperation: Model and Experiments
  P. Xuan, V. Lesser, and S. Zilberstein. Proceedings of the Fifth International Conference on Autonomous Agents (AGENTS), Montreal, Canada, 2001. [abs] [pdf]

• Planetary Rover Control as a Markov Decision Process
  D.S. Bernstein, S. Zilberstein, R. Washington, and J. Bresina. The 6th International Symposium on Artificial Intelligence, Robotics and Automation in Space, Montreal, Canada, 2001. [abs] [pdf]

• Optimal Scheduling of Progressive Processing Tasks
  S. Zilberstein and A.I. Mouaddib. International Journal of Approximate Reasoning, 25(3):169--186, 2000. [abs] [pdf]

• A Value-Driven System for Autonomous Information Gathering
  J. Grass and S. Zilberstein. Journal of Intelligent Information Systems, 14:5-27, 2000. [abs] [pdf]

• Dynamic Scheduling of Progressive Processing Plans
  S. Zilberstein, A.I. Mouaddib, and A. Arnt. Proceedings of ECAI 2000 Workshop on New Results in Planning, Scheduling and Design, Berlin, Germany, August, 2000. [abs] [pdf]

• The Complexity of Decentralized Control of Markov Decision Processes
  D.S. Bernstein, S. Zilberstein, and N. Immerman. Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI), Stanford, California, July, 2000. [abs] [pdf]

• Communication in Multi-agent Markov Decision Processes
  P. Xuan, V. Lesser, and S. Zilberstein. Proceedings of ICMAS Workshop on Game Theoretic and Decision Theoretic Agents, Boston, MA, July, 2000. [abs] [pdf]

• Optimizing Resource Utilization in Planetary Rovers
  S. Zilberstein and A.I. Mouaddib. Proceedings of the 2nd NASA International Workshop on Planning and Scheduling for Space, 163-168, 2000. [abs] [pdf]

• Control in a 3D Reconstruction System Using Selective Perception
  M. Marengoni, A. Hanson, S. Zilberstein, and E. Riseman. Proceedings of the 7th IEEE International Conference on Computer Vision, Kerkyra, Greece, 1999. [abs] [pdf]

• Real-Time Problem-Solving with Contract Algorithms
  S. Zilberstein, F. Charpillet, and P. Chassaing. Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999. [abs] [pdf]

• Reactive Control of Dynamic Progressive Processing
  S. Zilberstein and and A.I. Mouaddib. Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999. [abs] [pdf]

• Optimal Sequencing of Contract Algorithms
  S. Zilberstein, F. Charpillet, and P. Chassaing. Bar-Ilan Symposium on the Foundation of Artificial Intelligence (BISFAI), Ramat Gan, Israel, 1999. [abs] [pdf]

• A Heuristic Search Algorithm for Markov Decision Problems
  E.A. Hansen and S. Zilberstein. Bar-Ilan Symposium on the Foundation of Artificial Intelligence (BISFAI), Ramat Gan, Israel, 1999. [abs] [pdf]

• Optimal Scheduling of Dynamic Progressive Processing
  A.I. Mouaddib and S. Zilberstein. Proceedings of the 13th Biennial European Conference on Artificial Intelligence (ECAI), Brighton, UK, 1998. (Best Paper Award) [abs] [pdf]

• Heuristic Search in Cyclic AND/OR Graphs
  E.A. Hansen and S. Zilberstein. Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), Madison, Wisconsin, 1998. [abs] [pdf]

• New Directions in Modeling and Control of Progressive Processing
  A.I. Mouaddib, S. Zilberstein and Victor Danilchenko. ECAI-98 Workshop on Monitoring and Control of Real-Time Intelligent Systems, Brighton, UK, 1998. [abs] [pdf]

• From HTML to Usable Data: Problems in Meaning and Credibility in the WWW
  J. Grass and S. Zilberstein. AAAI-98 Workshop on AI and Information Integration, Madison, Wisconsin, 1998. [abs] [pdf]

• Satisficing and Bounded Optimality
  S. Zilberstein. AAAI Spring Symposium on Satisficing Models, Stanford, California, 1998. [abs] [pdf]

• Handling Duration Uncertainty in Meta-Level Control of Progressive Processing
  A.I. Mouaddib and S. Zilberstein. Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI), Nagoya, Japan, 1997. [abs] [pdf]

• Value-Driven Information Gathering
  J. Grass and S. Zilberstein. AAAI Workshop on Building Resource-Bounded Reasoning Systems, Providence, Rhode Island, 1997. [abs] [pdf]

• Anytime Heuristic Search: First Results
  E.A. Hansen, S. Zilberstein, and V.A. Danilchenko. Technical Report 97-50, Computer Science Department, University of Massachusetts, 1997. [abs] [pdf]

• An Anytime Approach to Analyzing Software Systems
  D. Rubenstein, L. Osterweil, and S. Zilberstein. Proceedings of the 10th International Florida Artificial Intelligence Research Symposium (FLAIRS), 386-391, Daytona Beach, Florida, 1997. [abs] [pdf]

• Formalizing the Notion of "Satisficing"
  S. Zilberstein. AAAI Spring Symposium on Qualitative Preferences in Deliberation and Practical Reasoning, Stanford, California, 1997. [abs] [pdf]

• Using Anytime Algorithms in Intelligent Systems
  S. Zilberstein. AI Magazine, 17(3):73-83, 1996. [abs] [pdf]

• Reinforcement Learning for Mixed Open-loop and Closed-loop Control
  E.A. Hansen, A.G. Barto, and S. Zilberstein. Proceedings of Neural Information Processing Systems Conference (NIPS), 1026-1032, Denver, Colorado, 1996. [abs] [pdf]

• Monitoring the Progress of Anytime Problem-Solving
  E.A. Hansen and S. Zilberstein. Proceedings of the 13th National Conference on Artificial Intelligence (AAAI), 1229-1234, Portland, Oregon, 1996. [abs] [pdf]

• Anytime Algorithm Development Tools
  J. Grass and S. Zilberstein. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):20-27, 1996. [abs] [pdf]

• Monitoring Anytime Algorithms
  E.A. Hansen and S. Zilberstein. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):28-33, 1996. [abs] [pdf]

• Intelligent Information Gathering Using Decision Models
  S. Zilberstein and V. Lesser. Technical Report 96-35, Computer Science Department, University of Massachusetts, 1996. [abs] [pdf]

• Resource-Bounded Sensing and Planning in Autonomous Systems
  S. Zilberstein. Autonomous Robots, 3:31-48, 1996. [abs] [pdf]

• Optimal Composition of Real-Time Systems
  S. Zilberstein and S.J. Russell. Artificial Intelligence, 82(1-2):181-213, 1996. [abs] [pdf]

• Models of Bounded Rationality
  S. Zilberstein. AAAI Fall Symposium on Rational Agency, Cambridge, Massachusetts, 1995. [abs] [pdf]

• Optimizing Decision Quality with Contract Algorithms
  S. Zilberstein. Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 1576-1582, Montreal, Canada, 1995. [abs] [pdf]

• Knowledge-Based Anytime Computation
  A.I. Mouaddib and S. Zilberstein. Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 775-781, Montreal, Canada, 1995. [abs] [pdf]

• Approximate Reasoning Using Anytime Algorithms
  S. Zilberstein and S.J. Russell. In S. Natarajan (Ed.), Imprecise and Approximate Computation, Kluwer Academic Publishers, 1995. [abs] [pdf]

• On the Utility of Planning
  S. Zilberstein. In M. Pollack (Ed.), SIGART Bulletin Special Issue on Evaluating Plans, Planners, and Planning Systems, 6(1):42-47, 1995. [abs] [pdf]

• Teaching Graduate-level Artificial Intelligence
  S. Zilberstein. AAAI Fall Symposium on Instruction of Introductory AI, New Orleans, Louisiana, 1994. [abs] [pdf]

• Meta-level Control of Approximate Reasoning: A Decision Theoretic Approach
  S. Zilberstein. Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems (ISMIS), 114-123, Charlotte, North Carolina, 1994. [abs] [pdf]

• Anytime Sensing, Planning and Action: A Practical Model for Robot Control
  S. Zilberstein and S.J. Russell. Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI), 1402-1407, Chambery, France, 1993. [abs] [pdf]

• Operational Rationality through Compilation of Anytime Algorithms
  S. Zilberstein. Ph.D. dissertation, Computer Science Division, University of California at Berkeley, 1993. [abs] [pdf]

• Efficient Resource-Bounded Reasoning in AT-RALPH
  S. Zilberstein and S.J. Russell. Proceedings of the First International Conference on AI Planning Systems (AIPS), 260-266, College Park, Maryland, 1992. [abs] [pdf]

• Composing Real-Time Systems
  S.J. Russell and S. Zilberstein. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), 212-217, Sydney, Australia, 1991. [abs] [pdf]