Sciweavers

3047 search results - page 98 / 610
» Randomized Parallel Selection
Sort
View
ICIP
2005
IEEE
14 years 11 months ago
Off-line multiple object tracking using candidate selection and the Viterbi algorithm
This paper presents a probabilistic framework for off-line multiple object tracking. At each timestep, a small set of deterministic candidates is generated which is guaranteed to ...
Anil C. Kokaram, François Pitié, Roz...
DAC
2002
ACM
14 years 11 months ago
False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
Jing-Jia Liou, Angela Krstic, Li-C. Wang, Kwang-Ti...
TCIAIG
2010
13 years 4 months ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
EVOW
2010
Springer
14 years 4 months ago
A New Selection Ratio for Large Population Sizes
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
Fabien Teytaud
EUROPAR
2005
Springer
14 years 3 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber