JAIR Volume 7 (1997)
Michael Wellman,
Editor in Chief
320 pp., references, index, illus., $85.00 softcover, ISBN 978-1-55860-531-2
[Add to Cart] [View Cart]
Contents
Defining Relative Likelihood in Partially-Ordered Preferential Structures / 1-24
J. Y. Halpern
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time / 25-45
T. Drakengren and P. Jonsson
A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty / 47-66
D. L. Mammen and T. Hogg
Identifying Hierarchical Structure in Sequences: A linear-time algorithm / 67-82
C. G. Nevill-Manning and I. H. Witten
Towards Flexible Teamwork / 83-124
M. Tambe
Analysis of Three-Dimensional Protein Images / 125-159
L. Leherte, J. Glasgow, K. Baxter, E. Steeg, and S. Fortier
Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures / 161-198
L. H. Ihrig and S. Kambhampati
A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains / 199-230
N. L. Zhang and W. Liu
Dynamic Non-Bayesian Decision Making / 231-248
D. Monderer and M. Tennenholtz
When Gravity Fails: Local Search Topology / 249-281
J. Frank, P. Cheeseman and J. Stutz
Bidirectional Heuristic Search Reconsidered / 283-317.
H. Kaindl and G. Kainz