Sciweavers

16082 search results - page 430 / 3217
» Algorithms for Marketing-Mix Optimization
Sort
View
CGO
2006
IEEE
16 years 28 days ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
GECCO
2003
Springer
16 years 3 days 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
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 8 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
ICC
2007
IEEE
111views Communications» more  ICC 2007»
16 years 1 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...
PDCAT
2007
Springer
16 years 1 months ago
Optimal Routing in Binomial Graph Networks
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...