Sciweavers

33 search results - page 4 / 7
» Improved Approximation Algorithms for Relay Placement
Sort
View
ISPD
2006
ACM
102views Hardware» more  ISPD 2006»
14 years 20 days ago
A faster implementation of APlace
APlace is a high quality, scalable analytical placer. This paper describes our recent efforts to improve APlace for speed and scalability. We explore various wirelength and densi...
Andrew B. Kahng, Qinke Wang
DAC
2005
ACM
14 years 7 months ago
Diffusion-based placement migration
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...
Haoxing Ren, David Zhigang Pan, Charles J. Alpert,...
TKDE
2002
123views more  TKDE 2002»
13 years 6 months ago
Coordinated Placement and Replacement for Large-Scale Distributed Caches
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
Madhukar R. Korupolu, Michael Dahlin
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 2 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
MOBIQUITOUS
2007
IEEE
14 years 29 days ago
Optimal Relay Node Fault Recovery
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
Fei Che, Liang Zhao, Errol L. Lloyd