674 search results - page 55 / 135 » The computational complexity of the parallel knock-out probl... |
ICPADS
2008
IEEE
15 years 7 months ago
2008
IEEE
Peer-to-Peer systems have become a substantial element in computer networking. Distributing the load and splitting complex tasks are only some reasons why many developers have com...
105
click to vote
ARTS
1999
Springer
15 years 5 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
130
click to vote
JMLR
2011
14 years 8 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
101
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
We describe a prototype Web service for model reduction of very large-scale linear systems. Specifically, a userfriendly interface is designed so that model reduction can be easi...
118
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...