4565 search results - page 464 / 913 » Time Optimal Self-Stabilizing Algorithms |
138
click to vote
IJRR
2010
15 years 1 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
173
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
181
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
117
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
134
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...