Sciweavers

1090 search results - page 161 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
13 years 7 months ago
Notes on averaging over acyclic digraphs and discrete coverage control
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
Chunkai Gao, Jorge Cortés, Francesco Bullo
WEA
2009
Springer
111views Algorithms» more  WEA 2009»
14 years 2 months ago
A Heuristic for Fair Correlation-Aware Resource Placement
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
Raouf Boutaba, Martin Karsten, Maxwell Young
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
13 years 11 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
CCGRID
2009
IEEE
14 years 2 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
CISS
2008
IEEE
14 years 2 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie