Sciweavers

25 search results - page 4 / 5
» A new hybrid solution to boost SAT solver performance
Sort
View
ENTCS
2006
136views more  ENTCS 2006»
13 years 11 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
ICSE
2007
IEEE-ACM
14 years 11 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...
AAAI
2006
14 years 8 days ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
CP
2005
Springer
14 years 4 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
CP
2006
Springer
14 years 2 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...