683 search results - page 79 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
128
click to vote
TSMC
2008
15 years 3 months ago
2008
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
117
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—Recently, it has been shown that a simple, distributed CSMA algorithm is throughput-optimal. However, throughput-optimality is established under the perfect or ideal car...
156
click to vote
AAMAS
2007
Springer
15 years 10 months ago
2007
Springer
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
146
click to vote
CG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
149
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...