Sciweavers

3016 search results - page 189 / 604
» The Online Transportation Problem
Sort
View
ACTA
1998
111views more  ACTA 1998»
15 years 4 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
CIG
2005
IEEE
15 years 10 months ago
How to Protect Peer-to-Peer Online Games from Cheats
Abstract- Recently, P2P (peer-to-peer) online game systems have attracted a great deal of public attention. They work without central servers, thus, the maintenance and organizatio...
Haruhiro Yoshimoto, Rie Shigetomi, Hideki Imai
ALT
2010
Springer
15 years 6 months ago
Online Multiple Kernel Learning: Algorithms and Mistake Bounds
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
Rong Jin, Steven C. H. Hoi, Tianbao Yang
NIPS
2007
15 years 5 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
15 years 5 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin