193 search results - page 26 / 39 » sat 2007 |
118
Voted
IJCAI
2003
15 years 1 months ago
2003
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
101
click to vote
SARA
2007
Springer
15 years 6 months ago
2007
Springer
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
91
Voted
ICSE
2007
IEEE-ACM
16 years 13 days ago
2007
IEEE-ACM
Linux distributions often include package management tools such as apt-get in Debian or yum in RedHat. Using information about package dependencies and conflicts, such tools can d...
DAC
2007
ACM
16 years 1 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
118
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...