73 search results - page 4 / 15 » Fast Monte Carlo Algorithms for Permutation Groups |
DATE
2010
IEEE
14 years 17 days ago
2010
IEEE
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
GRID
2010
Springer
13 years 4 months ago
2010
Springer
Abstract The EGEE grid offers the necessary infrastructure and resources for reducing the running time of particle tracking Monte-Carlo applications like GATE. However, efforts are...
ASPDAC
2000
ACM
13 years 12 months ago
2000
ACM
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
WSC
2000
13 years 8 months ago
2000
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...