Sciweavers

344 search results - page 45 / 69
» The Santa Claus problem
Sort
View
CADE
2006
Springer
15 years 11 months ago
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
Peter Baumgartner, Renate A. Schmidt
ICDCS
1998
IEEE
15 years 3 months ago
Flexible Exception Handling in the OPERA Process Support System
Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a n...
Claus Hagen, Gustavo Alonso
AAAI
1998
15 years 12 days ago
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
Soraya B. Rana, Robert B. Heckendorn, L. Darrell W...
JAR
2002
72views more  JAR 2002»
14 years 10 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
CP
2010
Springer
14 years 9 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman