39 search results - page 1 / 8 » A Binary Decision Tree Abstract Domain Functor |
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Domain Patrick Cousot2,3 , Radhia Cousot1,3 , and Laurent Mauborgne3,4 1 Centre National de la Recherche Scientifique 2 Courant Institute of Mathematical Sciences, New York Univer...
CAV
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
KDD
1999
ACM
13 years 9 months ago
1999
ACM
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
SAS
2010
Springer
13 years 3 months ago
2010
Springer
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...