17541 search results - page 219 / 3509 » Complexity in scalable computing |
116
Voted
ICSE
2007
IEEE-ACM
16 years 3 months ago
2007
IEEE-ACM
Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for Inter...
124
Voted
CCGRID
2006
IEEE
15 years 9 months ago
2006
IEEE
Scalable atomic and parallel access to noncontiguous regions of a file is essential to exploit high performance I/O as required by large-scale applications. Parallel I/O framewor...
164
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Today's large multi-core Internet servers support thousands of concurrent connections or flows. The computation ability of future server platforms will depend on increasing n...
128
Voted
DEBS
2008
ACM
15 years 5 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
110
Voted
CORR
2010
Springer
15 years 2 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...