Sciweavers

112 search results - page 11 / 23
» Ordered Binary Decision Diagrams and the Davis-Putnam Proced...
Sort
View
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
14 years 8 days ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin
UAI
1996
13 years 9 months ago
A Graph-Theoretic Analysis of Information Value
We derive qualitative relationships about the informationalrelevance of variables in graphical decision models based on a consideration of the topology of the models. Speci cally,...
Kim-Leng Poh, Eric Horvitz
ICDE
2010
IEEE
192views Database» more  ICDE 2010»
14 years 2 months ago
XML reasoning made practical
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...
Pierre Genevès, Nabil Layaïda
COCOA
2007
Springer
14 years 2 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 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