960 search results - page 107 / 192 » Optimal Monte Carlo Algorithms |
SSPR
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
TSP
2008
13 years 10 months ago
2008
This paper studies the statistical behavior of an affine combination of the outputs of two least mean-square (LMS) adaptive filters that simultaneously adapt using the same white G...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
ICCAD
2007
IEEE
14 years 7 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
DCC
2010
IEEE
14 years 5 months ago
2010
IEEE
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...