JAIR Volume 28 Articles
Each entry in this table of contents provides links to an individual article and its appendices (if any):
B. Bidyuk and R. Dechter (2007) "Cutset Sampling for Bayesian Networks", Volume 28, pages 1-48
P. Everaere, S. Konieczny and P. Marquis (2007) "The Strategy-Proofness Landscape of Merging", Volume 28, pages 49-105
H. Jia, C. Moore and D. Strain (2007) "Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively", Volume 28, pages 107-118
A. I. Coles and A. J. Smith (2007) "Marvin: A Heuristic Search Planner with Online Macro-Action Learning", Volume 28, pages 119-156
Abstract | PDF | PostScript | HTML | doi:10.1613/jair.2077
A. D. Procaccia and J. S. Rosenschein (2007) "Junta Distributions and the Average-Case Complexity of Manipulating Elections", Volume 28, pages 157-181
J. C. Beck and N. Wilson (2007) "Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations", Volume 28, pages 183-232
L. Blumrosen, N. Nisan and I. Segal (2007) "Auctions with Severely Bounded Communication", Volume 28, pages 233-266
E. A. Hansen and R. Zhou (2007) "Anytime Heuristic Search", Volume 28, pages 267-297
C. Bettini, S. Mascetti and X. S. Wang (2007) "Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets", Volume 28, pages 299-348
S. R. Jodogne and J. H. Piater (2007) "Closed-Loop Learning of Visual Control Policies", Volume 28, pages 349-391
A. S. Fukunaga and R. E. Korf (2007) "Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems", Volume 28, pages 393-429
F. Lin and Y. Chen (2007) "Discovering Classes of Strongly Equivalent Logic Programs", Volume 28, pages 431-451
B. J. Clement, E. H. Durfee and A. C. Barrett (2007) "Abstract Reasoning for Planning and Coordination", Volume 28, pages 453-515
Abstract | PDF | PostScript | HTML | doi:10.1613/jair.2158
Y. Gao and J. Culberson (2007) "Consistency and Random Constraint Satisfaction Models", Volume 28, pages 517-557
