4037 search results - page 229 / 808 » Routing without ordering |
FPGA
2000
ACM
14 years 2 months ago
2000
ACM
In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain ...
CCR
2002
13 years 10 months ago
2002
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
ICCAD
2009
IEEE
13 years 8 months ago
2009
IEEE
Modern circuits become harder to route with the ever decreasing design features. Previous routability-driven placement techniques are usually tightly coupled with the underlying p...
AMC
2007
13 years 11 months ago
2007
This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants and the moments of measures without sophisticated programming...
ICC
2008
IEEE
14 years 5 months ago
2008
IEEE
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...