5553 search results - page 138 / 1111 » Parallel Implementation of Sch |
134
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
We had introduced the massively parallel global cellular automata (GCA) model. Parallel algorithms derived from applications can be mapped straight forward onto this model. In thi...
138
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
118
click to vote
PVM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper presents the concept of parallelisation of a solver for Answer Set Programming (ASP). While there already exist some approaches to parallel ASP solving, there ...
108
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we present an evaluation of selected parallel strategies for Simulated Annealing and Simulated Evolution, identifying the impact of various issues on the effectivene...
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper reports the development of the Concerto platform, which is dedicated to supporting the deployment of parallel adaptive components on clusters of workstations. The curre...