Sciweavers

398 search results - page 41 / 80
» Spider Diagrams of Order
Sort
View
FIW
2000
147views Communications» more  FIW 2000»
13 years 11 months ago
Formalising the Chisel Feature Notation
The CHISEL notation was developed by Bellcore as an informal graphical notation for describing telecomms services and features. CRESS (CHISEL Representation Employing Systematic S...
Kenneth J. Turner
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 4 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
DAC
1999
ACM
14 years 2 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
CASCON
1996
126views Education» more  CASCON 1996»
13 years 11 months ago
Inter-class testing of O-O software in the presence of polymorphism
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...
Amit M. Paradkar
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 3 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler