Sciweavers

206 search results - page 32 / 42
» Three Hoppy path problems and ternary paths
Sort
View
TON
2008
98views more  TON 2008»
13 years 7 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 4 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
ISCA
2002
IEEE
91views Hardware» more  ISCA 2002»
14 years 14 days ago
Slack: Maximizing Performance Under Technological Constraints
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
Brian A. Fields, Rastislav Bodík, Mark D. H...
CEC
2010
IEEE
13 years 7 months ago
Multi-objective mobile agent-based Sensor Network Routing using MOEA/D
Abstract— Mobile agents are often used in wireless sensor networks for distributed target detection with the goal of minimizing the transmission of non-critical data that negativ...
Andreas Konstantinidis 0002, Christoforos Charalam...