284 search results - page 7 / 57 » Sensitivity Analysis of the Result in Binary Decision Trees |
102
click to vote
KBS
2002
14 years 11 months ago
2002
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...
121
click to vote
COMPSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
96
Voted
ICML
2005
IEEE
16 years 13 days ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
117
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
85
Voted
DAC
1998
ACM
16 years 18 days ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...