4313 search results - page 125 / 863 » Using time travel to diagnose computer problems |
116
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
120
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
125
Voted
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
149
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
137
Voted
IJHPCA
2006
15 years 4 months ago
2006
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...