Sciweavers

1815 search results - page 28 / 363
» Path Planning for Network Performance
Sort
View
CISS
2008
IEEE
15 years 4 months ago
Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
Anna Kacewicz, Stephen B. Wicker
COMCOM
2004
78views more  COMCOM 2004»
14 years 9 months ago
Performance and control of network systems
We propose two flow control algorithms for networks with multiple paths between each source
Robert D. van der Mei, Frank Huebner
AI
2011
Springer
14 years 4 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
112
Voted
IWCMC
2010
ACM
14 years 7 months ago
High performance modified DSR routing protocol for WLAN mesh networks
This work presents a cross-layer modification to the DSR protocol which discovers high throughput paths on multi-hop wireless mesh networks. The modified DSR incorporates a metric...
Mustafa Ramadhan, Mark Davis
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 4 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner