107 search results - page 16 / 22 » Planning and Patching Proof |
105
click to vote
ECCC
2007
14 years 11 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
MICCAI
2007
Springer
16 years 20 days ago
2007
Springer
In cancer treatment, understanding the aggressiveness of the tumor is essential in therapy planning and patient follow-up. In this article, we present a novel method for quantifyin...
AIMSA
2008
Springer
15 years 6 months ago
2008
Springer
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
110
click to vote
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
AAAI
1997
15 years 1 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...