9997 search results - page 278 / 2000 » The case for crowd computing |
173
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
125
click to vote
ECOOPW
1998
Springer
15 years 11 months ago
1998
Springer
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as m...
154
click to vote
APN
2009
Springer
15 years 10 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...
176
click to vote
HPCN
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. Optimistic execution techniques are widely used in the field of parallel discrete event simulation. In this paper we discuss the use of optimism as a technique for paral...
195
click to vote
FPL
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...