2497 search results - page 45 / 500 » Requirements for models of achievable routing |
195
click to vote
ASPDAC
2006
ACM
16 years 23 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
193
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a har...
143
click to vote
COMCOM
1998
15 years 6 months ago
1998
Routing algorithms are required to guarantee the various quality-of-service (QoS) characteristics requested by the wide range of applications supported by Broadband Integrated Ser...
192
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
169
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Multimedia servers are increasingly employing parallel systems for the retrieval, scheduling and delivery of streaming multimedia content. However, given non-zero blockin...