Sciweavers

193 search results - page 26 / 39
» sat 2007
Sort
View
IJCAI
2003
14 years 10 months ago
Sampling Combinatorial Spaces Using Biased Random Walks
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 ...
Jordan Erenrich, Bart Selman
85
Voted
SARA
2007
Springer
15 years 3 months ago
A Meta-CSP Model for Optimal Planning
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...
Peter Gregory, Derek Long, Maria Fox
ICSE
2007
IEEE-ACM
15 years 9 months ago
OPIUM: Optimal Package Install/Uninstall Manager
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...
Chris Tucker, David Shuffelton, Ranjit Jhala, Sori...
DAC
2007
ACM
15 years 10 months ago
On-The-Fly Resolve Trace Minimization
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...
Ohad Shacham, Karen Yorav
SIGSOFT
2007
ACM
15 years 10 months ago
A specification-based approach to testing software product lines
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 ...
Engin Uzuncaova, Daniel Garcia, Sarfraz Khurshid, ...