JAIR Volume 9 (1998)
Michael Wellman, Editor in Chief
510 pp., references, index, illus., $85.00 softcover, ISBN 978-1-55860-633-3
[Add to Cart] [View Cart]
Contents
The Computational Complexity of Probabilistic Planning / 1-36
M. L. Littman, J. Goldsmith, and M. Mundhenk
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference / 37-97
O. Ledeniov and S. Markovitch
Computational Aspects of Reordering Plans / 99-137
C. Backstrom
Adaptive Parallel Iterative Deepening Search / 139-165
D. J. Cook and R. C. Varnell
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians / 167-217
A. Ruiz, P. E. Lopez-de-Teruel, and M. C. Garrido
The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem / 219-245
B. Vandegriend and J. Culberson
An Empirical Approach to Temporal Reference Resolution / 247-293
J. M. Wiebe, T. P. O'Hara, T. Ohrstrom-Sandgren, and K. J. McKeever
The Ariadne's Clew Algorithm / 295-316
E. Mazer, J. M. Ahuactzin, and P. Bessiere
AntNet: Distributed Stigmergetic Control for Communications Networks / 317-365
G. Di Caro and M. Dorigo
The Automatic Inference of State Invariants in TIM / 367-421
M. Fox and D. Long
Complexity of Prioritized Default Logics / 423-461
J. Rintanen
A Temporal Description Logic for Reasoning about Actions and Plans / 463-506
A. Artale and E. Franconi