Volume 28, 2007
- Bozhena Bidyuk, Rina Dechter:
Cutset Sampling for Bayesian Networks.
1-48
- Patricia Everaere, Sébastien Konieczny, Pierre Marquis:
The Strategy-Proofness Landscape of Merging.
49-105
- Haixia Jia, Cristopher Moore, Doug Strain:
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively.
107-118
- Andrew Coles, Amanda Smith:
Marvin: A Heuristic Search Planner with Online Macro-Action Learning.
119-156
- Ariel D. Procaccia, Jeffrey S. Rosenschein:
Junta Distributions and the Average-Case Complexity of Manipulating Elections.
157-181
- J. Christopher Beck, Nic Wilson:
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations.
183-232
- Liad Blumrosen, Noam Nisan, Ilya Segal:
Auctions with Severely Bounded Communication.
233-266
- Eric A. Hansen, Rong Zhou:
Anytime Heuristic Search.
267-297
- Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wang:
Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets.
299-348
- Sébastien Jodogne, Justus H. Piater:
Closed-Loop Learning of Visual Control Policies.
349-391
- Alex S. Fukunaga, Richard E. Korf:
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems.
393-429
- Fangzhen Lin, Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs.
431-451
- Bradley J. Clement, Edmund H. Durfee, Anthony C. Barrett:
Abstract Reasoning for Planning and Coordination.
453-515
- Yong Gao, Joseph C. Culberson:
Consistency and Random Constraint Satisfaction Models.
517-557
Last update Fri May 24 20:31:12 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
