70 search results - page 14 / 14 » ESOW: Parallel Distributed Programming on the Web |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
DSRT
2008
IEEE
14 years 1 months ago
2008
IEEE
The DEVS formalism has been adopted and developed independently by many research teams, which led to various DEVS implementation versions. Consequently, different DEVS implementat...
ICS
2007
Tsinghua U.
14 years 1 months ago
2007
Tsinghua U.
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
SIGMOD
2010
ACM
14 years 8 days ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
EUROSYS
2010
ACM
14 years 1 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...