Sciweavers

1420 search results - page 2 / 284
» Representation of Graphs by OBDDs
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
13 years 11 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
GLVLSI
2000
IEEE
87views VLSI» more  GLVLSI 2000»
13 years 9 months ago
Speeding up symbolic model checking by accelerating dynamic variable reordering
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
Christoph Meinel, Christian Stangier
TCAD
1998
161views more  TCAD 1998»
13 years 4 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
13 years 10 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
AAAI
2008
13 years 7 months ago
Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered bi...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...