JAIR Volume 24 (2005)
Moshe Tennenholtz, Editor in Chief
950 pp., references, index, illus., $85.00 softcover, ISBN 978-1-57735-256-3
[Add to Cart] [View Cart]
Contents
CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features / 1-48
D. Ortiz-Boyer, C. Hervás-Martínez, and N. García-Pedrajas
A Framework for Sequential Planning in Multi-Agent Settings / 49-79
P. J. Gmytrasiewicz and P. Doshi
Risk-Sensitive Reinforcement Learning Applied to Control under Constraints / 81-108
P. Geibel and F. Wysotzki
Solving Set Constraint Satisfaction Problems using ROBDDs / 109-156
P. J. Hawkins, V. Lagoon, and P. J. Stuckey
Learning Content Selection Rules for Generating Object Descriptions in Dialogue / 157-194
P. W. Jordan and M. A. Walker
Perseus: Randomized Point-based Value Iteration for POMDPs / 195-220
M. T. J. Spaan and N. Vlassis
Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search / 221-261
J. P. Watson. L. D. Whitley and A. E. Howe
Integrating Learning from Examples into the Search for Diagnostic Policies / 263-303
V. Bayer-Zubek and T. G. Dietterich
Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis / 305-339
P. Cimiano, A. Hotho, and S. Staab
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms / 341-356
R. Khardon, D. Roth and R. A. Servedio
Pure Nash Equilibria: Hard and Easy Games / 357-406
G. Gottlob, G. Greco, and F. Scarcello
Cooperative Information Sharing to Improve Distributed Learning in Multi-Agent Systems / 407-463
P. S. Dutta, N, R. Jennings and L. Moreau
Reasoning about Action: An Argumentation-Theoretic Approach / 465-518
Q. B. Vo and N. Y. Foo
The Deterministic Part of IPC-4: An Overview / 519-579
J. Hoffmann and S. Edelkamp
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators / 581-621
A. Botea, M. Enzenberger, M. Mueller, and J. Schaeffer
Hiding Satisfying Assignments: Two are Better than One / 623-639
D. Achlioptas, H. Jia and C. Moore
Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results / 641-684
N. Samaras and K. Stergiou
Where "Ignoring Delete Lists" Works: Local Search Topology in Planning Benchmarks / 685-758
J. Hoffmann
RETRACTED: DO NOT CITE Relational Dynamic Bayesian Networks / 759-797
S. Sanghai, P. Domingos, and D. Weld
Probabilistic Hybrid Action Models for Predicting Concurrent Percept-driven Robot Behavior / 799-849
M. Beetz and H. Grosskreutz
The First Probabilistic Track of the International Planning Competition / 851-887
H. L. S. Younes, M. L. Littman, D. Weissman, and J. Asmuth
Ignorability in Statistical and Probabilistic Inference / 889-917
M. Jaeger