14379 search results - page 2506 / 2876 » is 2000 |
179
click to vote
SIROCCO
2000
15 years 8 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
174
click to vote
SIROCCO
2000
15 years 8 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
190
click to vote
SODA
2000
ACM
15 years 8 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...
194
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
186
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...