Sciweavers

3016 search results - page 422 / 604
» The Online Transportation Problem
Sort
View
COLT
2001
Springer
15 years 9 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
GD
1998
Springer
15 years 8 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
117
Voted
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 8 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
137
Voted
DATE
2004
IEEE
135views Hardware» more  DATE 2004»
15 years 8 months ago
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 8 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang