158 search results - page 13 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
PPOPP
2006
ACM
15 years 3 months ago
2006
ACM
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
81
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Body sensor networks (BSNs) have been developed for a set of performance-critical applications, including smart healthcare, assisted living, emergency response, athletic perform...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
COCO
2004
Springer
15 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...