Sciweavers

2150 search results - page 124 / 430
» On a restricted cross-intersection problem
Sort
View
125
Voted
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
16 years 1 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
LPNMR
2009
Springer
15 years 11 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
127
Voted
FOCS
2008
IEEE
15 years 11 months ago
On the Union of Cylinders in Three Dimensions
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
Esther Ezra
118
Voted
TASE
2008
IEEE
15 years 11 months ago
ProB gets Nauty: Effective Symmetry Reduction for B and Z Models
Symmetry reduction holds great promise to counter the state explosion problem. However, currently it is “conducting a life on the fringe”, and is not widely applied, mainly du...
Corinna Spermann, Michael Leuschel
CONCUR
2007
Springer
15 years 11 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi