2474 search results - page 56 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
123
click to vote
PPAM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
118
Voted
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
101
click to vote
DNA
2004
Springer
15 years 7 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
144
click to vote
PDPTA
2000
15 years 3 months ago
2000
A class of singularly perturbed two-point boundary-value problems (BVPs) for second-order ordinary differential equations (DEs) is considered here. In order to obtain numerical sol...
97
Voted
ICS
1995
Tsinghua U.
15 years 6 months ago
1995
Tsinghua U.
The elimination of induction variables and the parallelization of reductions in FORTRAN programs have been shown to be integral to performance improvement on parallel computers 7,...