Sciweavers

68 search results - page 13 / 14
» Optimal Bounds for Matching Routing on Trees
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 25 days ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
LCN
2007
IEEE
14 years 9 days ago
Placing Multicast Proxies for Internet Live Media Streaming
— Placing multicast proxies on the Internet can largely reduce the delivery delay of Internet live media streaming using overlay multicast mechanisms. In this paper, we propose a...
Jun Guo, Sanjay Jha
WWW
2006
ACM
14 years 6 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ADHOCNOW
2009
Springer
14 years 19 days ago
Auction Aggregation Protocols for Wireless Robot-Robot Coordination
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
Ivan Mezei, Veljko Malbasa, Ivan Stojmenovic