692 search results - page 2 / 139 » BDD minimization for approximate computing |
WADS
2007
Springer
13 years 11 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
DAGSTUHL
2006
13 years 6 months ago
2006
ICCAD
2003
IEEE
14 years 1 months ago
2003
IEEE
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
AAAI
2012
11 years 7 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...