Sciweavers

3360 search results - page 185 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
IAT
2005
IEEE
16 years 5 days ago
Optimizing Agents Operation in Partially Inaccessible and Disruptive Environment
The algorithm we present in this paper aims to optimally distribute and connect the community of loosely coupled middle agents ensuring communication accessibility in a dynamic, i...
David Sislák, Martin Rehák, Michal P...
PPAM
2007
Springer
16 years 20 days ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
ICDCS
2005
IEEE
16 years 4 days ago
On Cooperative Content Distribution and the Price of Barter
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
Prasanna Ganesan, Mukund Seshadri
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
15 years 8 months ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
16 years 3 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri