920 search results - page 74 / 184 » Generating Satisfiable Problem Instances |
143
Voted
DISOPT
2011
14 years 7 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
92
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
95
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
An analysis for the phase transition in a random NK landscape model is given. For the fixed ratio model, NK(n, k, z), Gao and Culberson [17] showed that a random instance generat...
110
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider in...
102
click to vote
DLOG
2004
15 years 2 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...