Sciweavers

368 search results - page 7 / 74
» Improved Online Algorithms for the Sorting Buffer Problem
Sort
View
ORL
2000
77views more  ORL 2000»
13 years 7 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
TC
2008
13 years 7 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
Marcin Bienkowski
SIGACT
2010
68views more  SIGACT 2010»
13 years 2 months ago
A survey of buffer management policies for packet switches
Over the past decade, there has been great interest in the study of buffer management policies in the context of packet transmission for network switches. In a typical model, a sw...
Michael H. Goldwasser
TMC
2012
11 years 9 months ago
Elevator-Assisted Sensor Data Collection for Structural Health Monitoring
—Sensor networks nowadays are widely used for structural health monitoring; for example, the sensor monitoring system deployed on the Guangzhou New TV Tower, China. While wired s...
Tao Zhang, Dan Wang, Jiannong Cao, Yi Qing Ni, Lij...