Sciweavers

3780 search results - page 73 / 756
» Algorithms for Game Metrics
Sort
View
IJCAI
2001
13 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
WINE
2007
Springer
161views Economy» more  WINE 2007»
14 years 4 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
ECCV
2004
Springer
14 years 12 months ago
Image Clustering with Metric, Local Linear Structure, and Affine Symmetry
Abstract. This paper addresses the problem of clustering images of objects seen from different viewpoints. That is, given an unlabelled set of images of n objects, we seek an unsup...
Jongwoo Lim, Jeffrey Ho, Ming-Hsuan Yang, Kuang-Ch...
GIS
2004
ACM
14 years 11 months ago
A novel improvement to the R*-tree spatial index using gain/loss metrics
The R*-tree is a state-of-the-art spatial index structure. It has already found its way into commercial systems. The most important improvement of the R*-tree over the original R-...
Donghui Zhang, Tian Xia
ATAL
2011
Springer
12 years 10 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...