Sciweavers

5230 search results - page 16 / 1046
» Dynamic Optimality -- Almost
Sort
View
EVOW
2004
Springer
14 years 3 months ago
Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept
Abstract. Dynamic optimization using evolutionary algorithms is receiving increasing interests. However, typical test functions for comparing the performance of various dynamic opt...
Yaochu Jin, Bernhard Sendhoff
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
13 years 9 months ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 8 months ago
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin
IPPS
2006
IEEE
14 years 3 months ago
Skewed allocation of non-uniform data for broadcasting over multiple channels
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
Alan A. Bertossi, Maria Cristina Pinotti
CEC
2010
IEEE
13 years 11 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius