Sciweavers

1207 search results - page 20 / 242
» On distributed optimization using generalized gossip
Sort
View
113
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 24 days ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
130
Voted
PODC
2000
ACM
15 years 4 months ago
Debugging distributed programs using controlled re-execution
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
Neeraj Mittal, Vijay K. Garg
TWC
2008
135views more  TWC 2008»
15 years 11 days ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
91
Voted
ATAL
2003
Springer
15 years 5 months ago
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
Jiaying Shen, Victor R. Lesser, Norman Carver
93
Voted
CCGRID
2008
IEEE
15 years 7 months ago
On the Optimization of Resource Utilization in Distributed Multimedia Applications
—The application and research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and...
R. Yang, Robert D. van der Mei, D. Roubos, Frank J...