Sciweavers

1017 search results - page 90 / 204
» Throughput-centric routing algorithm design
Sort
View
DAC
2005
ACM
13 years 12 months ago
Faster and better global placement by a new transportation algorithm
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
Ulrich Brenner, Markus Struzyna
ISPD
2010
ACM
157views Hardware» more  ISPD 2010»
14 years 4 months ago
SafeChoice: a novel clustering algorithm for wirelength-driven placement
This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, s...
Jackey Z. Yan, Chris Chu, Wai-Kei Mak
ATAL
2005
Springer
14 years 3 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
CN
2006
91views more  CN 2006»
13 years 10 months ago
End-host controlled multicast routing
The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast func...
Karthik Lakshminarayanan, Ananth Rao, Ion Stoica, ...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 7 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd