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...
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...
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...
Weintroduce a parallel approach, "DT-SELECT," for selecting features used by inductive learning algorithms to predict protein secondary structure. DT-SELECTis able to ra...
—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...