Sciweavers

388 search results - page 42 / 78
» Convergence Properties of the K-Means Algorithms
Sort
View
ISCIS
2003
Springer
15 years 11 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi
JMLR
2010
130views more  JMLR 2010»
15 years 29 days ago
A Regularization Approach to Nonlinear Variable Selection
In this paper we consider a regularization approach to variable selection when the regression function depends nonlinearly on a few input variables. The proposed method is based o...
Lorenzo Rosasco, Matteo Santoro, Sofia Mosci, Ales...
ICASSP
2011
IEEE
14 years 10 months ago
Performance limits of LMS-based adaptive networks
In this work we analyze the mean-square performance of different strategies for adaptation over two-node least-mean-squares (LMS) networks. The results highlight some interesting ...
Xiaochuan Zhao, Ali H. Sayed
CP
2006
Springer
15 years 10 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
15 years 6 months ago
Notes on averaging over acyclic digraphs and discrete coverage control
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
Chunkai Gao, Jorge Cortés, Francesco Bullo