Sciweavers

466 search results - page 3 / 94
» Representation and Computation of Boolean Combinations of Sc...
Sort
View
CL
2000
Springer
14 years 5 days ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä
CAV
2000
Springer
187views Hardware» more  CAV 2000»
14 years 5 days ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
DEBS
2007
ACM
14 years 15 days ago
The arbitrary Boolean publish/subscribe model: making the case
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matchin...
Sven Bittner, Annika Hinze
CODES
1998
IEEE
14 years 25 days ago
Combining multiple models of computation for scheduling and allocation
Many applications include a variety off unctions from different domains. Therefore, they are best modeled with a combination of different modeling languages. For a sound design pr...
Dirk Ziegenbein, Rolf Ernst, Kai Richter, Jür...
CGI
2004
IEEE
14 years 9 days ago
Computer Aided Design for Origamic Architecture Models with Polygonal Representation
An Origamic Architecture (OA) is a folded sheet of perforated paper from which a three-dimensional structure "pops up" when it is opened. It is similar to a "pop-up...
Jun Mitani, Hiromasa Suzuki