1361 search results - page 29 / 273 » Boolean Comparison by Simulation |
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper aims at providing a better insight into the 3D approximations of the wave equation using compact finite-difference timedomain (FDTD) schemes in the context of room aco...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
AMAI
2005
Springer
14 years 9 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
PADS
2005
ACM
15 years 3 months ago
2005
ACM
— In this paper, a new event scheduling mechanism XEQ and a new rollback procedure rb-messages are proposed for use in optimistic logic simulation. We incorporate both of these t...