920 search results - page 82 / 184 » Generating Satisfiable Problem Instances |
92
Voted
AI
1999
Springer
15 years 10 days ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
138
Voted
SIAMCOMP
1998
15 years 9 days ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
109
click to vote
ICGI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
118
click to vote
MICCAI
2007
Springer
16 years 1 months ago
2007
Springer
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
DAC
2001
ACM
16 years 1 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...