Sciweavers

1578 search results - page 3 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
IPPS
1998
IEEE
13 years 11 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
DAC
2008
ACM
14 years 8 months ago
A progressive-ILP based routing algorithm for cross-referencing biochips
Due to recent advances in microfluidics technology, digital microfluidic biochips and their associated CAD problems have gained much attention, most of which has been devoted to d...
Ping-Hung Yuh, Sachin S. Sapatnekar, Chia-Lin Yang...
SENSYS
2006
ACM
14 years 1 months ago
Interest dissemination with directional antennas for wireless sensor networks with mobile sinks
Introducing mobile data sinks into wireless sensor networks (WSNs) improves the energy efficiency and the network lifetime, and is demanded for many application scenarios, such a...
Yihong Wu, Lin Zhang, Yiqun Wu, Zhisheng Niu
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
14 years 7 months ago
Oblivious routing in directed graphs with random demands
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig...