1082 search results - page 50 / 217 » Stability of Locally Optimal Solutions |
ISDA
2008
IEEE
15 years 6 months ago
2008
IEEE
Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
107
click to vote
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
A common technique to deploy linear prediction to nonstationary signals is time segmentation and local analysis. In [1], the temporal changes of linear prediction coefficients (L...
FLAIRS
2003
15 years 1 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
GECCO
2008
Springer
15 years 28 days ago
2008
Springer
This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution...