3495 search results - page 36 / 699 » On the random satisfiable process |
EPIA
1997
Springer
14 years 2 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
DICTA
2003
14 years 3 days ago
2003
Many industrial manufacturing processes depend on the rapid and accurate measurement of circular objects, for example, pipe, tube and ball and roller bearings, to ensure that the c...
ICASSP
2010
IEEE
13 years 11 months ago
2010
IEEE
We address the problem of Bayesian estimation where the statistical relation between the signal and measurements is only partially known. We propose modeling partial Baysian knowl...
ICGI
2010
Springer
13 years 8 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 ...
RSA
2008
13 years 10 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...