1534 search results - page 150 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
173
Voted
TON
2010
15 years 4 months ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
166
click to vote
PDCN
2004
15 years 7 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
148
click to vote
HPCC
2009
Springer
15 years 10 months ago
2009
Springer
—Grid computing has emerged as a way to share geographically and organizationally distributed resources that may belong to different institutions or administrative domains. In th...
141
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
187
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we present an in-depth analysis of the memory system performance of the DSS commercial workloads on two state-of-the-art multiprocessors: the SGI Origin 2000 and th...