JAIR Volume 28 (2007)
Toby Walsh, Editor in Chief
562 pp., references, index, illus., $85.00 softcover, ISBN 978-1-57735-352-2
[Add to Cart] [View Cart]
Contents
Cutset Sampling for Bayesian Networks / 1
B. Bidyuk and R. Dechter
The Strategy-Proofness Landscape of Merging / 49
P. Everaere, S. Konieczny, and P. Marquis
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively / 107
H. Jia, C. Moore and D. Strain
Marvin: A Heuristic Search Planner with Online Macro-Action Learning / 119
A. I. Coles and A. J. Smith
Junta Distributions and the Average-Case Complexity of Manipulating Elections / 157
A. D. Procaccia and J. S. Rosenschein
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations / 183
J. C. Beck and N. Wilson
Auctions with Severely Bounded Communication / 233
L. Blumrosen, N. Nisan, and I. Segal
Anytime Heuristic Search / 267
E. A. Hansen and R. Zhou
Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets / 299
C. Bettini, S. Mascetti, and X. S. Wang
Closed-Loop Learning of Visual Control Policies / 349
S. R. Jodogne and J. H. Piater
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems / 393
A. S. Fukunaga and R. E. Korf
Discovering Classes of Strongly Equivalent Logic Programs / 431
F. Lin and Y. Chen
Abstract Reasoning for Planning and Coordination / 453
B. J. Clement, E. H. Durfee, and A. C. Barrett
Consistency and Random Constraint Satisfaction Models / 517
Y. Gao and J. Culberson
Index 559