Sciweavers

6045 search results - page 892 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
CEC
2010
IEEE
14 years 10 months ago
Tweaking a tower of blocks leads to a TMBL: Pursuing long term fitness growth in program evolution
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...
Tony E. Lewis, George D. Magoulas
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 10 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
INFOCOM
2011
IEEE
14 years 10 months ago
A nearly-optimal index rule for scheduling of users with abandonment
—We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of lin...
Urtzi Ayesta, Peter Jacko, Vladimir Novak
JCAM
2011
78views more  JCAM 2011»
14 years 9 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters