Sciweavers

450 search results - page 31 / 90
» Local Search with Congestion in Complex Communication Networ...
Sort
View
JAIR
2008
145views more  JAIR 2008»
14 years 9 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
ICCCN
2008
IEEE
15 years 4 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
PERVASIVE
2008
Springer
14 years 9 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
ICCAD
2005
IEEE
95views Hardware» more  ICCAD 2005»
15 years 6 months ago
Application-specific network-on-chip architecture customization via long-range link insertion
Networks-on-Chip (NoCs) represent a promising solution to complex on-chip communication problems. The NoC communication architectures considered so far are based on either complete...
Ümit Y. Ogras, Radu Marculescu