2168 search results - page 12 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
IMC
2010
ACM
13 years 5 months ago
2010
ACM
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
CIAC
2006
Springer
13 years 11 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 ...
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...