Sciweavers

302 search results - page 3 / 61
» Parallel computing to start the millennium
Sort
View
CG
2008
Springer
13 years 9 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
PODC
1999
ACM
13 years 11 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
SC
2009
ACM
14 years 2 months ago
Scalable computing with parallel tasks
Recent and future parallel clusters and supercomputers use SMPs and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have h...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
ICPADS
2006
IEEE
14 years 1 months ago
Snap-Stabilizing PIF and Useless Computations
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing pr...
Alain Cournier, Stéphane Devismes, Vincent ...
IJON
2007
83views more  IJON 2007»
13 years 7 months ago
Neurospaces: Towards automated model partitioning for parallel computers
Parallel computers have the computing power needed to simulate biologically accurate neuronal network models. Partitioning is the process of cutting a model in pieces and assignin...
Hugo Cornelis, Erik De Schutter