Sciweavers

1930 search results - page 6 / 386
» A Dynamic Graph Algorithm for the Highly Dynamic Network Pro...
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 5 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 5 days ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
HYBRID
2010
Springer
14 years 14 days ago
Distributed Kalman Filter algorithms for self-localization of mobile devices
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
Anne-Kathrin Hess, Anders Rantzer
NCA
2006
IEEE
14 years 1 months ago
An Adaptive Quality of Service Based Scheduling Algorithm for Wide Area Large Scale Problems
This paper explores the problem of dynamically scheduling large scale applications over wide area networks and then proposes an adaptive scheduling algorithm to provide quality of...
Wilson Lozano, Wilson Rivera
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 7 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman