Sciweavers

258 search results - page 19 / 52
» Improving Stability of Decision Trees
Sort
View
WSC
2008
14 years 1 days ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
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...
George Jiri Mejtsky
RTAS
2010
IEEE
13 years 7 months ago
Improved Task Management Techniques for Enforcing EDF Scheduling on Recurring Tasks
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...
Michael Short
ICALP
2001
Springer
14 years 2 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
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...
Amit Chakrabarti, Subhash Khot
FLAIRS
2004
13 years 11 months ago
Improved Situation Interpretation Metrics in Context-Based Reasoning Simulations
The current implementation of situation interpretation metrics (SIMs) in context-based reasoning (CxBR) simulations makes it difficult to effectively and efficiently characterize ...
Roberto Sánchez, Avelino J. Gonzalez
MCS
2009
Springer
14 years 2 months ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
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 ...
Amir Ahmad, Gavin Brown