562 search results - page 72 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
WCC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
URBAN
2008
14 years 9 months ago
2008
: There is a long tradition of describing cities through a focus on the characteristics of their residents. A brief review of the history of this approach to describing cities high...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
100
click to vote
FLAIRS
2004
14 years 11 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...