We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
"Bxbasic is presented as a programming tutorial, to develop and construct a Console Mode Scripting Engine and
Byte Code Compiler. The Bxbasic dialect, included here, is a sub...