218 search results - page 21 / 44 » Subexponential Algorithms for Unique Games and Related Probl... |
138
Voted
CCGRID
2008
IEEE
15 years 10 months ago
2008
IEEE
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
130
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcemen...
145
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...
153
Voted
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
212
Voted
Publication
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...