1420 search results - page 240 / 284 » Representation of Graphs by OBDDs |
DATE
2007
IEEE
15 years 8 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
118
click to vote
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
A fundamental problem in a large scale decentralized stream processing system is how to best utilize the available resources and admission control the bursty and high volume input...
132
Voted
APN
2007
Springer
15 years 8 months ago
2007
Springer
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
CCS
2007
ACM
15 years 8 months ago
2007
ACM
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
100
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...