502 search results - page 38 / 101 » Verifying Balanced Trees |
JDWM
2007
13 years 9 months ago
2007
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
TACAS
2007
Springer
14 years 4 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
ICTAI
2006
IEEE
14 years 4 months ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...
ICAS
2005
IEEE
14 years 3 months ago
2005
IEEE
— This paper presents a novel approach for efficient tree construction in ALM (Application Layer Multicast) using layered video coding. This system is suitable for the users in h...