1159 search results - page 20 / 232 » Binary Decision Graphs |
APN
2004
Springer
14 years 1 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The seabed characterization from sonar images is a very hard task because of the produced data and the unknown environment, even for an human expert. In this work we propose an ori...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
ENTCS
2006
13 years 7 months ago
2006
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...