503 search results - page 82 / 101 » Interpolative Boolean Logic |
150
click to vote
FPL
2003
Springer
15 years 11 months ago
2003
Springer
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
234
click to vote
SPIN
2001
Springer
15 years 10 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
165
click to vote
FPL
1997
Springer
15 years 10 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
147
click to vote
HYBRID
1997
Springer
15 years 10 months ago
1997
Springer
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
179
click to vote
CCL
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...