251 search results - page 16 / 51 » Lattice-Valued Binary Decision Diagrams |
DAC
1997
ACM
13 years 11 months ago
1997
ACM
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
COCOON
2006
Springer
13 years 11 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...
MICAI
2007
Springer
14 years 1 months ago
2007
Springer
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
RISE
2004
Springer
14 years 22 days ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
ISMVL
2010
IEEE
14 years 6 days ago
2010
IEEE
This paper proposes a new architecture for memorybased floating-point numeric function generators (NFGs). The design method uses piecewise-split edge-valued multivalued decision ...