451 search results - page 27 / 91 » Simulated Annealing for Convex Optimization |
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorit...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
ASPDAC
2004
ACM
14 years 1 months ago
2004
ACM
Non-rectangular (rectilinear) shape occurs very often in deep submicron floorplanning. Most previous algorithms are designed to handle only convex rectilinear blocks. However, han...
ICC
2011
IEEE
12 years 9 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...