2084 search results - page 257 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
RTSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement by-wire applications for taking smart decisions on the road...
COR
2008
14 years 10 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
OPODIS
2010
14 years 7 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...