549 search results - page 23 / 110 » Computing All the Best Swap Edges Distributively |
PVLDB
2010
14 years 8 months ago
2010
The goal of a threshold query is to detect all objects whose score exceeds a given threshold. This type of query is used in many settings, such as data mining, event triggering, a...
CPE
1998
Springer
15 years 1 months ago
1998
Springer
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
ICS
2003
Tsinghua U.
15 years 2 months ago
2003
Tsinghua U.
This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
FORTE
2010
14 years 11 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...