Sciweavers

ORL
2007
112views more  ORL 2007»
13 years 4 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...
ICDCS
1995
IEEE
13 years 8 months ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch
COMPGEOM
1992
ACM
13 years 8 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
ICPP
1998
IEEE
13 years 9 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
FOCS
1998
IEEE
13 years 9 months ago
Jitter Control in QoS Networks
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
Yishay Mansour, Boaz Patt-Shamir
IPPS
2000
IEEE
13 years 9 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
ICRA
2000
IEEE
122views Robotics» more  ICRA 2000»
13 years 9 months ago
Application of a Model-Free Algorithm for the Packing of Irregular Shaped Objects in Semiconductor Manufacture
A Robotic System is being developed to automate the crucible packing process in the CZ semiconductor wafer production. It requires the delicate manipulation and packing of highly ...
Vivek A. Sujan, Steven Dubowsky
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
13 years 11 months ago
Cost-Aware Caching Algorithms for Distributed Storage Servers
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
13 years 11 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga