Sciweavers

1480 search results - page 165 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
CSCLP
2008
Springer
15 years 2 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
EDBT
2006
ACM
159views Database» more  EDBT 2006»
16 years 25 days ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
115
Voted
PODC
2010
ACM
15 years 4 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
97
Voted
ECAI
2010
Springer
14 years 10 months ago
A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...
Thomas Voice, Ruben Stranders, Alex Rogers, Nichol...
87
Voted
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
15 years 6 months ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...