258 search results - page 19 / 52 » Improving Stability of Decision Trees |
148
click to vote
WSC
2008
15 years 8 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
184
click to vote
RTAS
2010
IEEE
15 years 3 months ago
2010
IEEE
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
156
click to vote
ICALP
2001
Springer
15 years 10 months 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...
127
click to vote
FLAIRS
2004
15 years 7 months ago
2004
The current implementation of situation interpretation metrics (SIMs) in context-based reasoning (CxBR) simulations makes it difficult to effectively and efficiently characterize ...
190
click to vote
MCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...