Sciweavers

185 search results - page 24 / 37
» Discrete online TSP
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Using additive expert ensembles to cope with concept drift
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
Jeremy Z. Kolter, Marcus A. Maloof
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
13 years 9 months ago
Large-Scale Many-Class Learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Michael Connor
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
14 years 4 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Noa Avigdor-Elgrabli, Yuval Rabani
NETWORKING
2007
13 years 9 months ago
Reinforcement Learning-Based Load Shared Sequential Routing
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
Fariba Heidari, Shie Mannor, Lorne Mason
APN
2005
Springer
14 years 1 months ago
Particle Petri Nets for Aircraft Procedure Monitoring Under Uncertainty
In the framework of the study and analysis of new flight procedures, we propose a new Petri net-based formalism to represent both continuous and discrete evolutions and uncertaint...
Charles Lesire, Catherine Tessier