17541 search results - page 324 / 3509 » Complexity in scalable computing |
135
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This typ...
125
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
One of the differences among the various approaches to suspension-based tabled evaluation is the scheduling strategy. The two most popular strategies are local and batched evaluat...
131
Voted
APAL
2010
15 years 4 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
88
Voted
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
