Volume 9, 1998
- Michael L. Littman, Judy Goldsmith, Martin Mundhenk:
The Computational Complexity of Probabilistic Planning.
1-36
- Oleg Ledeniov, Shaul Markovitch:
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference.
37-97
- Christer Bäckström:
Computational Aspects of Reordering Plans.
99-137
- Diane J. Cook, R. Craig Varnell:
Adaptive Parallel Iterative Deepening Search.
139-165
- Alberto Ruiz, Pedro E. López-de-Teruel, M. Carmen Garrido:
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians.
167-217
- Basil Vandegriend, Joseph C. Culberson:
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem.
219-245
- Janyce Wiebe, Thomas P. O'Hara, Thorsten Öhrström-Sandgren, Kenneth J. McKeever:
An Empirical Approach to Temporal Reference Resolution.
247-293
- Emmanuel Mazer, Juan Manuel Ahuactzin, Pierre Bessière:
The Ariadne's Clew Algorithm.
295-316
- Gianni Di Caro, Marco Dorigo:
AntNet: Distributed Stigmergetic Control for Communications Networks.
317-365
- Maria Fox, Derek Long:
The Automatic Inference of State Invariants in TIM.
367-421
- Jussi Rintanen:
Complexity of Prioritized Default Logics.
423-461
- Alessandro Artale, Enrico Franconi:
A Temporal Description Logic for Reasoning about Actions and Plans.
463-506
Last update Sat May 18 20:38:40 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
