39 search results - page 2 / 8 » A Binary Decision Tree Abstract Domain Functor |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
CCL
1994
Springer
13 years 9 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
ICANNGA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
ROBOCUP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. An object recognition process in general is designed as a domain specific, highly specialized task. As the complexity of such a process tends to be rather inestimable, m...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...