Sciweavers

4 search results - page 1 / 1
» On the Average Path Length in Decision Diagrams of Multiple-...
Sort
View
ISMVL
2003
IEEE
85views Hardware» more  ISMVL 2003»
13 years 10 months ago
On the Average Path Length in Decision Diagrams of Multiple-Valued Functions
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate t...
Jon T. Butler, Tsutomu Sasao
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
13 years 10 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
13 years 11 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
IOR
2007
89views more  IOR 2007»
13 years 4 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...