Sciweavers

105 search results - page 13 / 21
» Distributed Algorithms for Computing Alternate Paths Avoidin...
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
ATAL
2009
Springer
14 years 2 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...
ICPADS
2010
IEEE
13 years 5 months ago
Fault Tolerant Network Routing through Software Overlays for Intelligent Power Grids
Control decisions of intelligent devices in critical infrastructure can have a significant impact on human life and the environment. Insuring that the appropriate data is availabl...
Christopher Zimmer, Frank Mueller
JPDC
2007
96views more  JPDC 2007»
13 years 7 months ago
Optimal pipeline decomposition and adaptive network mapping to support distributed remote visualization
This paper discusses algorithmic and implementation aspects of a distributed remote visualization system that optimally decomposes and adaptively maps the visualization pipeline t...
Mengxia Zhu, Qishi Wu, Nageswara S. V. Rao, S. Sit...
PODC
2004
ACM
14 years 29 days ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen