533 search results - page 41 / 107 » Playing games with approximation algorithms |
LCC
1994
13 years 11 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
IJCAI
2007
13 years 9 months ago
2007
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...