5. SARA 2002:
Kananaskis,
Alberta,
Canada
Sven Koenig, Robert C. Holte (Eds.):
Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings.
Lecture Notes in Computer Science 2371 Springer 2002, ISBN 3-540-43941-2 BibTeX
@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
Full Presentations
- Tristan Cazenave:
Admissible Moves in Two-Player Games.
52-63
Electronic Edition (Springer LINK) BibTeX
- Berthe Y. Choueiry, Amy M. Davis:
Dynamic Bundling: Less Effort for More Solutions.
64-82
Electronic Edition (Springer LINK) BibTeX
- Eric A. Hansen, Rong Zhou, Zhengzhu Feng:
Symbolic Heuristic Search Using Decision Diagrams.
83-98
Electronic Edition (Springer LINK) BibTeX
- Michael Heymann, Asaf Degani:
On the Construction of Human-Automation Interfaces by Formal Abstraction.
99-115
Electronic Edition (Springer LINK) BibTeX
- Lina Khatib, Paul H. Morris, Robert A. Morris:
Pareto Optimization of Temporal Decisions.
116-125
Electronic Edition (Springer LINK) BibTeX
- T. K. Satish Kumar:
An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection.
126-139
Electronic Edition (Springer LINK) BibTeX
- Daniel P. Miranker, Malcolm C. Taylor, Anand Padmanaban:
A Tractable Query Cache by Approximation.
140-151
Electronic Edition (Springer LINK) BibTeX
- Supratik Mukhopadhyay, Andreas Podelski:
An Algebraic Framework for Abstract Model Checking.
152-169
Electronic Edition (Springer LINK) BibTeX
- Todd W. Neller:
Action Timing Discretization with Iterative-Refinement.
170-177
Electronic Edition (Springer LINK) BibTeX
- Aarati Parmar:
Formalizing Approximate Objects and Theories: Some Initial Results.
178-195
Electronic Edition (Springer LINK) BibTeX
- Balaraman Ravindran, Andrew G. Barto:
Model Minimization in Hierarchical Reinforcement Learning.
196-211
Electronic Edition (Springer LINK) BibTeX
- Martin Stolle, Doina Precup:
Learning Options in Reinforcement Learning.
212-223
Electronic Edition (Springer LINK) BibTeX
- Xuan-Ha Vu, Djamila Sam-Haroud, Marius-Calin Silaghi:
Approximation Techniques for Non-linear Problems with Continuum of Solutions.
224-241
Electronic Edition (Springer LINK) BibTeX
- Bruno Zanuttini:
Approximation of Relations by Propositional Formulas: Complexity and Semantics.
242-255
Electronic Edition (Springer LINK) BibTeX
- Jean-Daniel Zucker, Nicolas Bredeche, Lorenza Saitta:
Abstracting Visual Percepts to Learn Concepts.
256-273
Electronic Edition (Springer LINK) BibTeX
Short Presentations
- Bruno Apolloni, Fabio Baraghini, Giorgio Palmas:
PAC Meditation on Boolean Formulas.
274-281
Electronic Edition (Springer LINK) BibTeX
- J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
On the Reformulation of Vehicle Routing Problems and Scheduling Problems.
282-289
Electronic Edition (Springer LINK) BibTeX
- T. K. Satish Kumar, Richard Dearden:
The Oracular Constraints Method.
290-298
Electronic Edition (Springer LINK) BibTeX
- Ilya Levner, Vadim Bulitko, Omid Madani, Russell Greiner:
Performance of Lookahead Control Policies in the Face of Abstractions and Approximations.
299-307
Electronic Edition (Springer LINK) BibTeX
- William T. B. Uther, Manuela M. Veloso:
TTree: Tree-Based State Generalization with Temporally Abstract Actions.
308-315
Electronic Edition (Springer LINK) BibTeX
- Jun Zhang, Adrian Silvescu, Vasant Honavar:
Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction.
316-323
Electronic Edition (Springer LINK) BibTeX
Research Summaries
Copyright © Sat May 16 23:36:41 2009
by Michael Ley (ley@uni-trier.de)
