Sciweavers

438 search results - page 25 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
SPAA
2009
ACM
14 years 8 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
PODC
2009
ACM
14 years 2 days ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
ATAL
2011
Springer
12 years 7 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
CSB
2004
IEEE
106views Bioinformatics» more  CSB 2004»
13 years 11 months ago
A Theoretical Analysis of Gene Selection
A great deal of recent research has focused on the challenging task of selecting differentially expressed genes from microarray data (`gene selection'). Numerous gene selecti...
Sach Mukherjee, Stephen J. Roberts