Sciweavers

3016 search results - page 55 / 604
» The Online Transportation Problem
Sort
View
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
13 years 11 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
ATMOS
2007
138views Optimization» more  ATMOS 2007»
13 years 11 months ago
A new concept of robustness
In this paper a new concept of robustness is introduced and the corresponding optimization problem is stated. This new concept is applied to transportation network designs in which...
Ricardo García, Ángel Marín, ...
DAM
2008
78views more  DAM 2008»
13 years 10 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
COCOON
1998
Springer
14 years 2 months ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
ITNG
2007
IEEE
14 years 4 months ago
Multi-path Routing for Mesh/Torus-Based NoCs
In networks-on-chip (NoC) designs, delay variations and crosstalk noise have become a serious issue with the continuously shrinking geometry of semiconductor devices and the incre...
Yaoting Jiao, Yulu Yang, Ming He, Mei Yang, Yingta...