Sciweavers

3016 search results - page 37 / 604
» The Online Transportation Problem
Sort
View
PIMRC
2008
IEEE
14 years 4 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
14 years 3 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
COMCOM
2006
80views more  COMCOM 2006»
13 years 10 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
IPL
2008
61views more  IPL 2008»
13 years 10 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
WAOA
2007
Springer
104views Algorithms» more  WAOA 2007»
14 years 4 months ago
On the Online Unit Clustering Problem
We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh
Leah Epstein, Rob van Stee