Sciweavers

3049 search results - page 80 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GECCO
2003
Springer
15 years 9 months ago
Optimization Using Particle Swarms with Near Neighbor Interactions
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...
Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K...
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
15 years 8 months ago
The correlation-triggered adaptive variance scaling IDEA
It has previously been shown analytically and experimentally that continuous Estimation of Distribution Algorithms (EDAs) based on the normal pdf can easily suffer from premature ...
Jörn Grahl, Peter A. N. Bosman, Franz Rothlau...
PR
2008
85views more  PR 2008»
15 years 4 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
INFOCOM
2011
IEEE
14 years 8 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
INFOCOM
2012
IEEE
13 years 6 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu