2474 search results - page 41 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
119
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
112
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
102
click to vote
IPPS
2010
IEEE
14 years 12 months ago
2010
IEEE
In this paper we present the venture of porting two different algorithms for solving the two-dimensional advection PDE on the CBE platform, an in-place and an outof-place one, and ...
103
click to vote
CG
2010
Springer
14 years 12 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
110
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...