Sciweavers

3422 search results - page 527 / 685
» Random Subset Optimization
Sort
View
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 6 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 6 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
INFOCOM
2011
IEEE
14 years 6 months ago
SigSag: Iterative detection through soft message-passing
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...
INFOCOM
2011
IEEE
14 years 6 months ago
Connected coverage in wireless networks with directional antennas
—In this paper, we address a new unexplored problem - what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name im...
Zuoming Yu, Jin Teng, Xiaole Bai, Dong Xuan, Weiji...
JMLR
2012
13 years 5 months ago
Beyond Logarithmic Bounds in Online Learning
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...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...