472 search results - page 29 / 95 » Functional simulation using binary decision diagrams |
159
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
168
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
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...
166
click to vote
ETS
2010
IEEE
15 years 7 months ago
2010
IEEE
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 ...
171
click to vote
CAIP
2009
Springer
15 years 9 months ago
2009
Springer
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...
195
click to vote
AROBOTS
2010
15 years 4 months ago
2010
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...