Sciweavers

242 search results - page 29 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
FLAIRS
2004
15 years 1 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
IJCV
1998
163views more  IJCV 1998»
14 years 11 months ago
CONDENSATION - Conditional Density Propagation for Visual Tracking
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot repre...
Michael Isard, Andrew Blake
IPPS
2010
IEEE
14 years 9 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
CG
2010
Springer
14 years 9 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
CEC
2010
IEEE
15 years 25 days ago
A Mean-Variance Optimization algorithm
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
Istvan Erlich, Ganesh K. Venayagamoorthy, Nakawiro...