Abstraction, Reformulation, and Approximation

5th International Symposium, SARA 2002 Kananaskis, Alberta, Canada August 2–4, 2002 Proceedings

Editors:

ISBN: 978-3-540-43941-7 (Print) 978-3-540-45622-3 (Online)

Table of contents (39 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XI

  2. Invited Presentations

    1. No Access

      Book Chapter

      Pages 1-17

      Model Checking and Abstraction

    2. No Access

      Book Chapter

      Pages 18-32

      Reformulation in Planning

    3. No Access

      Book Chapter

      Pages 33-50

      Spatiotemporal Abstraction of Stochastic Sequential Processes

    4. No Access

      Book Chapter

      Pages 51-51

      State Space Relaxation and Search Strategies in Dynamic Programming

  3. Invited Presentations

    1. No Access

      Book Chapter

      Pages 52-63

      Admissible Moves in Two-Player Games

    2. No Access

      Book Chapter

      Pages 64-82

      Dynamic Bundling: Less Effort for More Solutions

    3. No Access

      Book Chapter

      Pages 83-98

      Symbolic Heuristic Search Using Decision Diagrams

    4. No Access

      Book Chapter

      Pages 99-115

      On the Construction of Human-Automation Interfaces by Formal Abstraction

    5. No Access

      Book Chapter

      Pages 116-125

      Pareto Optimization of Temporal Decisions

    6. No Access

      Book Chapter

      Pages 126-139

      An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection

    7. No Access

      Book Chapter

      Pages 140-151

      A Tractable Query Cache by Approximation

    8. No Access

      Book Chapter

      Pages 152-169

      An Algebraic Framework for Abstract Model Checking

    9. No Access

      Book Chapter

      Pages 170-177

      Action Timing Discretization with Iterative-Refinement

    10. No Access

      Book Chapter

      Pages 178-195

      Formalizing Approximate Objects and Theories: Some Initial Results

    11. No Access

      Book Chapter

      Pages 196-211

      Model Minimization in Hierarchical Reinforcement Learning

    12. No Access

      Book Chapter

      Pages 212-223

      Learning Options in Reinforcement Learning

    13. No Access

      Book Chapter

      Pages 224-241

      Approximation Techniques for Non-linear Problems with Continuum of Solutions

    14. No Access

      Book Chapter

      Pages 242-255

      Approximation of Relations by Propositional Formulas: Complexity and Semantics

    15. No Access

      Book Chapter

      Pages 256-273

      Abstracting Visual Percepts to Learn Concepts

  4. Short Presentations

    1. No Access

      Book Chapter

      Pages 274-281

      PAC Meditation on Boolean Formulas

previous Page of 2