25 search results - page 3 / 5 » Approximation and Decomposition of Binary Decision Diagrams |
JUCS
2010
13 years 7 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...
COCOON
2006
Springer
14 years 8 days 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...
ICDE
2010
IEEE
14 years 8 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...
WIA
2004
Springer
14 years 1 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 ...
ICCAD
2010
IEEE
13 years 6 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 ...