2926 search results - page 282 / 586 » Partially Optimal Routing |
146
click to vote
IPPS
2005
IEEE
15 years 9 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...
106
click to vote
ASPDAC
2004
ACM
15 years 9 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...
110
click to vote
ICCAD
1996
IEEE
15 years 8 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...
142
click to vote
ADHOC
2007
15 years 4 months ago
2007
In the past five years Bluetooth scatternets were one of the most promising wireless networking technologies for ad hoc networking. In such networks, mobility together with the f...
216
click to vote
TWC
2008
15 years 4 months ago
2008
In order to adapt to time-varying wireless channels, various channel-adaptive schemes have been proposed to exploit inherent spatial diversity in mobile/wireless ad hoc networks w...