507 search results - page 52 / 102 » Sizes of Ordered Decision Trees |
C3S2E
2010
ACM
13 years 9 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
AIIA
2003
Springer
13 years 11 months ago
2003
Springer
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
ICALP
2001
Springer
14 years 10 days ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
SWAT
1992
Springer
13 years 12 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
WSC
2004
13 years 9 months ago
2004
This paper discusses an extended adaptive supply network simulation model that explicitly captures growth (in terms of change in size over time, and birth and death) based on Utte...