25 search results - page 3 / 5 » Approximation and Decomposition of Binary Decision Diagrams |
162
click to vote
JUCS
2010
15 years 4 months ago
2010
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
172
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
171
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
207
click to vote
WIA
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
174
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...