Sciweavers

472 search results - page 29 / 95
» Functional simulation using binary decision diagrams
Sort
View
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 2 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 3 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
ETS
2010
IEEE
150views Hardware» more  ETS 2010»
13 years 10 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
14 years 9 days ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
AROBOTS
2010
138views more  AROBOTS 2010»
13 years 7 months ago
A provably complete exploration strategy by constructing Voronoi diagrams
We present novel exploration algorithms and a control law that enables the construction of Voronoi diagrams over unknown areas using a single vehicle equipped with range sensors. T...
Jonghoek Kim, Fumin Zhang, Magnus Egerstedt