Sciweavers

1361 search results - page 5 / 273
» Boolean Comparison by Simulation
Sort
View
ORDER
2008
86views more  ORDER 2008»
13 years 7 months ago
Comparison of MacNeille, Canonical, and Profinite Completions
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
Guram Bezhanishvili, Jacob Vosmaer
IJCAI
2001
13 years 9 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
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...
Alan M. Frisch, Timothy J. Peugniez
FUIN
2008
103views more  FUIN 2008»
13 years 8 months ago
Implementing Sorting Networks with Spiking Neural P Systems
Spiking neural P systems simulate the behavior of neurons sending signals through axons. Recently, some applications concerning Boolean circuits and sorting algorithms have been pr...
Rodica Ceterchi, Alexandru Ioan Tomescu
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
14 years 1 months ago
Using conjugate symmetries to enhance gate-level simulations
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Peter M. Maurer