674 search results - page 72 / 135 » The computational complexity of the parallel knock-out probl... |
139
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
112
click to vote
CONCUR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
113
click to vote
DCOSS
2008
Springer
15 years 3 months ago
2008
Springer
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
100
click to vote
SC
2004
ACM
15 years 6 months ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
108
click to vote
HPDC
2008
IEEE
15 years 8 months ago
2008
IEEE
As grid computation systems become larger and more complex, manually diagnosing failures in jobs becomes impractical. Recently, machine-learning techniques have been proposed to d...