1768 search results - page 215 / 354 » Optimal routing in Chord |
130
click to vote
SASN
2006
ACM
15 years 7 months ago
2006
ACM
Node misbehavior in wireless ad hoc networks leads to sudden unpredictable changes in network topology, resulting in fluctuation of traffic load and capacity for already existin...
106
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
FCCM
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
ICCAD
1996
IEEE
15 years 5 months ago
1996
IEEE
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...