 | Volume 25 |
 |
 | Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems - R. Mailler and V. R. Lesser |
| Approximate Policy Iteration with a Policy Language Bias: Solving Relational Markov Decision Processes - A. Fern, S. Yoon and R. Givan |
| Decision-Theoretic Planning with non-Markovian Rewards - S. Thiebaux, C. Gretton, J. Slaney, D. Price and F. Kabanza |
| Logical Hidden Markov Models - K. Kersting, L. De Raedt and T. Raiko |
| An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events - A. Gerevini, A. Saetti and I. Serina |
| A Continuation Method for Nash Equilibria in Structured Games - B. Blum, C. R. Shelton and D. Koller |
| Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web - P. Adjiman, P. Chatalic, F. Goasdoue, M. C. Rousset and L. Simon |
| Engineering a Conformant Probabilistic Planner - N. Onder, G. C. Whelan and L. Li |
| Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition - P. Haslum |
| Representing Conversations for Scalable Overhearing - G. Gutnik and G. A. Kaminka |
| Fault Tolerant Boolean Satisfiability - A. Roy |
| Dynamic Local Search for the Maximum Clique Problem - W. Pullan and H. H. Hoos |
| On Graphical Modeling of Preference and Importance - R. I. Brafman, C. Domshlak and S. E. Shimony |
| Negotiating Socially Optimal Allocations of Resources - U. Endriss, N. Maudet, F. Sadri and F. Toni |
| Learning in Real-Time Search: A Unifying Framework - V. Bulitko and G. Lee |
|
