Sciweavers

2862 search results - page 174 / 573
» Bicriteria Network Design Problems
Sort
View
IPPS
2007
IEEE
15 years 5 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
INFOCOM
2002
IEEE
15 years 3 months ago
Scheduling Algorithms for a Cache Pre-Filling Content Distribution Network
Abstract—Cache pre-filling is emerging as a new concept for increasing the availability of popular web items in cache servers. According to this concept, web items are sent by a...
Reuven Cohen, Liran Katzir, Danny Raz
ASPDAC
2005
ACM
90views Hardware» more  ASPDAC 2005»
15 years 28 days ago
Register placement for low power clock network
In modern VLSI designs, the increasingly severe power problem requests to minimize clock routing wirelength so that both power consumption and power supply noise can be alleviated...
Yongqiang Lu, Cliff C. N. Sze, Xianlong Hong, Qian...
COMPUTING
2010
14 years 8 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
15 years 7 months ago
Branch Merge Reduction of RLCM Networks
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
Bernard N. Sheehan