288 search results - page 53 / 58 » random 1998 |
JEA
1998
14 years 9 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
SIAMCOMP
1998
14 years 9 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
WSC
1998
14 years 11 months ago
1998
To begin using simulation in healthcare, one must first recognize the types of problems or decisions that can best be analyzed using simulation. Once a problem has been identified...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
85
Voted
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...