22 search results - page 4 / 5 » Incremental Breakout Algorithm with Variable Ordering |
94
Voted
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
103
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
81
Voted
ASPDAC
2009
ACM
15 years 4 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
CP
1995
Springer
15 years 1 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...