1243 search results - page 12 / 249 » On the locality of bounded growth |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
TC
2008
13 years 7 months ago
2008
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
DIALM
2003
ACM
14 years 24 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...