Sciweavers

2252 search results - page 385 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ICPP
1998
IEEE
14 years 1 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
ICCD
1997
IEEE
100views Hardware» more  ICCD 1997»
14 years 1 months ago
Optimal Clock Period Clustering for Sequential Circuits with Retiming
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
Arvind K. Karandikar, Peichen Pan, C. L. Liu
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 17 days ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
EUMAS
2006
13 years 10 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
SIROCCO
2004
13 years 10 months ago
Long-Lived Rambo: Trading Knowledge for Communication
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
Chryssis Georgiou, Peter M. Musial, Alexander A. S...