9997 search results - page 88 / 2000 » The case for crowd computing |
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
SASO
2007
IEEE
15 years 4 months ago
2007
IEEE
The concept of self-organization is rapidly gaining importance in the area of distributed computing systems. However, we still lack the necessary means for engineering such system...
SAINT
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
JUCS
2010
14 years 4 months ago
2010
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...