Volume 4,
1996
- Peter van Beek, Dennis W. Manchak:
The Design and Experimental Analysis of Algorithms for Temporal Reasoning.
1-18
- Gerhard Brewka:
Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences.
19-36
- Arthur L. Delcher, Adam J. Grove, Simon Kasif, Judea Pearl:
Logarithmic-Time Updates and Queries in Probabilistic Networks.
37-59
- Lawrence K. Saul, Tommi Jaakkola, Michael I. Jordan:
Mean Field Theory for Sigmoid Belief Networks.
61-76
- J. Ross Quinlan:
Improved Use of Continuous Attributes in C4.5.
77-90
- Tad Hogg:
Quantum Computing and Phase Transitions in Combinatorial Search.
91-128
- David A. Cohn, Zoubin Ghahramani, Michael I. Jordan:
Active Learning with Statistical Models.
129-145
- Douglas H. Fisher:
Iterative Optimization and Simplification of Hierarchical Clusterings.
147-178
- Elena Marchiori:
Practical Methods for Proving Termination of General Logic Programs.
179-208
- Toby Walsh:
A Divergence Critic for Inductive Proof.
209-235
- Leslie Pack Kaelbling, Michael L. Littman, Andrew P. Moore:
Reinforcement Learning: A Survey.
237-285
- Louise Pryor, Gregg Collins:
Planning for Contingencies: A Decision-based Approach.
287-339
- Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
Least Generalizations and Greatest Specializations of Sets of Clauses.
341-363
- Jonathan Gratch, Steve A. Chien:
Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study.
365-396
- Geoffrey I. Webb:
Further Experimental Evidence against the Utility of Occam's Razor.
397-417
- Sanjay Bhansali, Glenn A. Kramer, Tim J. Hoar:
A Principled Approach Towards Symbolic Geometric Constraint Satisfaction.
419-443
- Prasad Tadepalli, Balas K. Natarajan:
A Formal Framework for Speedup Learning from Problems and Solutions.
445-475
- Ronen I. Brafman, Moshe Tennenholtz:
On Partially Controlled Multi-Agent Systems.
477-507
Copyright © Sat Nov 28 22:30:56 2009
by Michael Ley (ley@uni-trier.de)
