Sciweavers

1206 search results - page 191 / 242
» Convergence analysis of online algorithms
Sort
View
AAMAS
2007
Springer
14 years 5 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
ICTAI
2006
IEEE
14 years 4 months ago
An Approximation to Mean-Shift via Swarm Intelligence
Mean shift based feature space analysis has been shown to be an elegant, accurate and robust technique. The elegance in this non-parametric algorithm is mainly due to its simplici...
Mani Thomas, Chandra Kambhamettu
INFOCOM
2002
IEEE
14 years 3 months ago
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies.
—Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low per-node cost ...
Alberto Cerpa, Deborah Estrin
EMMCVPR
1997
Springer
14 years 3 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
CIS
2008
Springer
14 years 25 days ago
Cooperation Controlled Competitive Learning Approach for Data Clustering
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
Tao Li, Wenjiang Pei, Shao-ping Wang, Yiu-ming Che...