Sciweavers

3495 search results - page 36 / 699
» On the random satisfiable process
Sort
View
EPIA
1997
Springer
14 years 2 months ago
GenSAT: A Navigational Approach
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...
Yury V. Smirnov, Manuela M. Veloso
DICTA
2003
14 years 3 days ago
Isotropic Subpixel Measurement of Circular Objects
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...
Russell Horney, Imants D. Svalbe, Peter Wells
ICASSP
2010
IEEE
13 years 11 months ago
A minimax approach to Bayesian estimation with partial knowledge of the observation model
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...
Tomer Michaeli, Yonina C. Eldar
ICGI
2010
Springer
13 years 8 months ago
Exact DFA Identification Using SAT Solvers
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 ...
Marijn J. H. Heule, Sicco Verwer
RSA
2008
94views more  RSA 2008»
13 years 10 months ago
Random mappings with exchangeable in-degrees
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...
Jennie C. Hansen, Jerzy Jaworski