1017 search results - page 135 / 204 » Throughput-centric routing algorithm design |
122
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Multi-FPGA systems (MFS) are used for a great variety of applications, for instance, dynamically re-configurable hardware applications, digital circuit emulation, and num...
133
click to vote
IFIP
2003
Springer
15 years 8 months ago
2003
Springer
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...
145
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
114
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
100
Voted
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...