Sciweavers

3049 search results - page 183 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
16 years 18 days ago
A new collaborative evolutionary-swarm optimization technique
A new hybrid approach to optimization in dynamical environments called Collaborative Evolutionary-Swarm Optimization (CESO) is presented. CESO tracks moving optima in a dynamical ...
Rodica Ioana Lung, D. Dumitrescu
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
15 years 7 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
TON
2008
133views more  TON 2008»
15 years 6 months ago
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Cunqing Hua, Tak-Shing Peter Yum
ISCAS
2005
IEEE
122views Hardware» more  ISCAS 2005»
16 years 1 days ago
Towards a rigorous formulation of the space mapping technique for engineering design
—This paper deals with the Space Mapping (SM) approach to engineering design optimization. We attempt here a theoretical justification of methods that have already proven efficie...
Slawomir Koziel, John W. Bandler, Kaj Madsen
SIP
2003
15 years 7 months ago
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
Iain Russell, Alfred Mertins, Jiangtao Xi