2474 search results - page 94 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
142
Voted
ICPP
2002
IEEE
15 years 7 months ago
2002
IEEE
The advantages of pattern-based programming have been well-documented in the sequential literature. However patterns have yet to make their way into mainstream parallel computing,...
124
Voted
AIMSA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
140
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance com...
106
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
115
Voted
CLOUDCOM
2010
Springer
15 years 20 days ago
2010
Springer
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...