Sciweavers

121 search results - page 13 / 25
» Algorithms for optimal dyadic decision trees
Sort
View
ISCC
2005
IEEE
14 years 1 months ago
Optimizing the Reliable Distribution of Large Files within CDNs
Abstract Content Delivery Networks (CDNs) provide an efficient support for serving http and streaming media content while minimizing the network impact of content delivery as well...
Ludmila Cherkasova
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 1 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
EMO
2005
Springer
120views Optimization» more  EMO 2005»
14 years 1 months ago
Multiobjective Optimization on a Budget of 250 Evaluations
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
Joshua D. Knowles, Evan J. Hughes
HIS
2008
13 years 9 months ago
Evolutionary Training Set Selection to Optimize C4.5 in Imbalanced Problems
Classification in imbalanced domains is a recent challenge in machine learning. We refer to imbalanced classification when data presents many examples from one class and few from ...
Salvador García, Francisco Herrera
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 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