Volume 7,
1997
- Joseph Y. Halpern:
Defining Relative Likelihood in Partially-Ordered Structures.
1-24
- Thomas Drakengren, Peter Jonsson:
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time.
25-45
- Dorothy L. Mammen, Tad Hogg:
A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty.
47-66
- Craig G. Nevill-Manning, Ian H. Witten:
Identifying Hierarchical Strcture in Sequences: A Linear-Time Algorithm.
67-82
- Milind Tambe:
Towards Flexible Teamwork.
83-124
- Laurence Leherte, Janice I. Glasgow, Kim Baxter, Evan W. Steeg, Suzanne Fortier:
Analysis of Three-Dimensional Protein Images.
125-159
- Laurie H. Ihrig, Subbarao Kambhampati:
Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures.
161-198
- Nevin Lianwen Zhang, Wenju Lin:
A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains.
199-230
- Dov Monderer, Moshe Tennenholtz:
Dynamic Non-Bayesian Decision Making.
231-248
- Jeremy Frank, Peter Cheeseman, John Stutz:
When Gravity Fails: Local Search Topology.
249-281
- Hermann Kaindl, Gerhard Kainz:
Bidirectional Heuristic Search Reconsidered.
283-317
Copyright © Tue Nov 17 01:41:56 2009
by Michael Ley (ley@uni-trier.de)
