Sciweavers

11 search results - page 1 / 3
» Do SAT Solvers Make Good Configurators
Sort
View
SPLC
2008
13 years 6 months ago
Do SAT Solvers Make Good Configurators?
A configuration process is about finding a configuration, a setting, that satisfies the requirements given by the user and constraints imposed by the domain. Feature models are us...
Mikolás Janota
MASCOTS
2008
13 years 6 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu
FMCAD
2004
Springer
13 years 8 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
CP
2010
Springer
13 years 2 months ago
Ensemble Classification for Constraint Solver Configuration
The automatic tuning of the parameters of algorithms and automatic selection of algorithms has received a lot of attention recently. One possible approach is the use of machine lea...
Lars Kotthoff, Ian Miguel, Peter Nightingale
SAT
2009
Springer
113views Hardware» more  SAT 2009»
13 years 11 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...