2924 search results - page 467 / 585 » Lower Bounds in Distributed Computing |
151
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
130
click to vote
ICPP
1998
IEEE
15 years 8 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
193
click to vote
IRREGULAR
1998
Springer
15 years 8 months ago
1998
Springer
To achieve scalable parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is ...
119
click to vote
SPAA
1990
ACM
15 years 8 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
144
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...