86 search results - page 4 / 18 » Satisfiability Algorithms and Finite Quantification |
IJCAI
2001
14 years 10 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
IJCNN
2006
IEEE
15 years 3 months ago
2006
IEEE
— The present paper is devoted to the exploration of the properties of the simple spiking neuron model and quantification of the information transfer rate, which the separate neu...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
A classic result due to H?astad established that for every constant > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends o...