Sciweavers

1248 search results - page 161 / 250
» Decision Tree Grafting
Sort
View
DIS
2006
Springer
15 years 9 months ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...
WSC
2008
15 years 8 months 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
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 7 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
172
Voted
ISMB
1993
15 years 7 months ago
Protein Structure Prediction: Selecting Salient Features from Large Candidate Pools
Weintroduce a parallel approach, "DT-SELECT," for selecting features used by inductive learning algorithms to predict protein secondary structure. DT-SELECTis able to ra...
Kevin J. Cherkauer, Jude W. Shavlik
WOA
2007
15 years 7 months ago
An Agent Based Solution for Dispatching Items in a Distributed Environment
—This paper describes Herald, an agent based toolkit for dispatching and processing items in a distributed environment. Herald is suitable for scenarios where the process could b...
Christian Vecchiola, Alberto Grosso, Andrea Passad...