1578 search results - page 80 / 316 » Direct Routing: Algorithms and Complexity |
191
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
198
click to vote
HPCA
2008
IEEE
16 years 6 months ago
2008
IEEE
Interconnection networks-on-chip (NOCs) are rapidly replacing other forms of interconnect in chip multiprocessors and system-on-chip designs. Existing interconnection networks use...
158
click to vote
APCSAC
2005
IEEE
15 years 12 months ago
2005
IEEE
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
169
click to vote
DCOSS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
208
click to vote
HEURISTICS
2010
15 years 3 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...