17543 search results - page 131 / 3509 » Stochastic Optimization Algorithms |
183
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
155
click to vote
AAAI
2004
15 years 7 months ago
2004
In this paper we report some of the research endeavors we are embarking on as part of the Doctoral research of the first author. We have already completed an investigation of some...
142
click to vote
TSP
2008
15 years 6 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
166
click to vote
DATE
2007
IEEE
16 years 21 days ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
167
click to vote
IBPRIA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...