Sciweavers

2478 search results - page 340 / 496
» Quadtrees as an Abstract Domain
Sort
View
CIA
2007
Springer
16 years 20 days ago
Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
Avi Rosenfeld, Sarit Kraus, Charlie Ortiz
CP
2007
Springer
16 years 20 days ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
CPAIOR
2007
Springer
16 years 20 days ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
DAWAK
2007
Springer
16 years 20 days ago
Domination Mining and Querying
Abstract. Pareto dominance plays an important role in diverse application domains such as economics and e-commerce, and it is widely being used in multicriteria decision making. In...
Apostolos N. Papadopoulos, Apostolos Lyritsis, Ale...
ECML
2007
Springer
16 years 20 days ago
Statistical Debugging Using Latent Topic Models
Abstract. Statistical debugging uses machine learning to model program failures and help identify root causes of bugs. We approach this task using a novel Delta-Latent-Dirichlet-Al...
David Andrzejewski, Anne Mulhern, Ben Liblit, Xiao...