5. SARA 2002: Kananaskis, Alberta, Canada

@proceedings{DBLP:conf/sara/2002,
  editor    = {Sven Koenig and
               Robert C. Holte},
  title     = {Abstraction, Reformulation and Approximation, 5th International
               Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4,
               2002, Proceedings},
  booktitle = {SARA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2371},
  year      = {2002},
  isbn      = {3-540-43941-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Presentations

• Robert P. Kurshan:
  Model Checking and Abstraction. 1-17
  
• Derek Long, Maria Fox, Muna Hamdi:
  Reformulation in Planning. 18-32
  
• Sridhar Mahadevan:
  Spatiotemporal Abstraction of Stochastic Sequential Processes. 33-50
  
• Aristide Mingozzi:
  State Space Relaxation and Search Strategies in Dynamic Programming. 51
  

Full Presentations

• Tristan Cazenave:
  Admissible Moves in Two-Player Games. 52-63
  
• Berthe Y. Choueiry, Amy M. Davis:
  Dynamic Bundling: Less Effort for More Solutions. 64-82
  
• Eric A. Hansen, Rong Zhou, Zhengzhu Feng:
  Symbolic Heuristic Search Using Decision Diagrams. 83-98
  
• Michael Heymann, Asaf Degani:
  On the Construction of Human-Automation Interfaces by Formal Abstraction. 99-115
  
• Lina Khatib, Paul H. Morris, Robert A. Morris:
  Pareto Optimization of Temporal Decisions. 116-125
  
• T. K. Satish Kumar:
  An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection. 126-139
  
• Daniel P. Miranker, Malcolm C. Taylor, Anand Padmanaban:
  A Tractable Query Cache by Approximation. 140-151
  
• Supratik Mukhopadhyay, Andreas Podelski:
  An Algebraic Framework for Abstract Model Checking. 152-169
  
• Todd W. Neller:
  Action Timing Discretization with Iterative-Refinement. 170-177
  
• Aarati Parmar:
  Formalizing Approximate Objects and Theories: Some Initial Results. 178-195
  
• Balaraman Ravindran, Andrew G. Barto:
  Model Minimization in Hierarchical Reinforcement Learning. 196-211
  
• Martin Stolle, Doina Precup:
  Learning Options in Reinforcement Learning. 212-223
  
• Xuan-Ha Vu, Djamila Sam-Haroud, Marius-Calin Silaghi:
  Approximation Techniques for Non-linear Problems with Continuum of Solutions. 224-241
  
• Bruno Zanuttini:
  Approximation of Relations by Propositional Formulas: Complexity and Semantics. 242-255
  
• Jean-Daniel Zucker, Nicolas Bredeche, Lorenza Saitta:
  Abstracting Visual Percepts to Learn Concepts. 256-273
  

Short Presentations

• Bruno Apolloni, Fabio Baraghini, Giorgio Palmas:
  PAC Meditation on Boolean Formulas. 274-281
  
• J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
  On the Reformulation of Vehicle Routing Problems and Scheduling Problems. 282-289
  
• T. K. Satish Kumar, Richard Dearden:
  The Oracular Constraints Method. 290-298
  
• Ilya Levner, Vadim Bulitko, Omid Madani, Russell Greiner:
  Performance of Lookahead Control Policies in the Face of Abstractions and Approximations. 299-307
  
• William T. B. Uther, Manuela M. Veloso:
  TTree: Tree-Based State Generalization with Temporally Abstract Actions. 308-315
  
• Jun Zhang, Adrian Silvescu, Vasant Honavar:
  Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction. 316-323
  

Research Summaries

• Darse Billings:
  Abstracting Imperfect Information Game Trees. 324-325
  
• Adi Botea:
  Using Abstraction for Heuristic Search and Planning. 326-327
  
• Michael H. Bowling:
  Approximation Techniques in Multiagent Learning. 328-329
  
• Daniel Buettner:
  Abstraction and Reformulation in GraphPlan. 330
  
• Bradley J. Clement:
  Abstract Reasoning for Planning and Coordination. 331-332
  
• Irit Askira Gelman:
  Research Summary: Abstraction Techniques, and Their Value. 333-334
  
• Robert Glaubius:
  Reformulation of Non-binary Constraints. 335
  
• T. K. Satish Kumar:
  Reformulating Combinatorial Optimization as Constraint Satisfaction. 336-337
  
• Amy McGovern:
  Autonomous Discovery of Abstractions through Interaction with an Environment. 338-339
  
• Meeko Oishi:
  Interface Verification: Discrete Abstractions of Hybrid Systems. 340-341
  
• Yoshiaki Okubo, Xiaobo Li:
  Learning Semi-Lattice Codebooks for Image Compression. 342-343
  
• Marc Pickett:
  Research Summary. 344
  
• Wheeler Ruml:
  Principled Exploitation of Heuristic Information. 345-346
  
• Lin Xu:
  Reformulation of Temporal Constraint Networks. 347-348
  

Last update Wed Feb 15 05:16:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page