2474 search results - page 37 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
132
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
113
click to vote
CCGRID
2002
IEEE
15 years 7 months ago
2002
IEEE
We introduce the Symphony framework, a software ion layer that can sit on top of grid systems. Symphony provides a unified API for grid application developers and offers a graphic...
118
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
112
click to vote
SC
2000
ACM
15 years 6 months ago
2000
ACM
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
122
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...