Sciweavers

3780 search results - page 345 / 756
» Algorithms for Game Metrics
Sort
View
IPCO
2001
166views Optimization» more  IPCO 2001»
15 years 9 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
215
Voted
EVOW
2010
Springer
16 years 2 months ago
Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search
Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modify...
Arpad Rimmel, Fabien Teytaud
158
Voted
CEC
2007
IEEE
16 years 1 months ago
Experiments with Monte Carlo Othello
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
Philip Hingston, Martin Masek
164
Voted
COLT
2004
Springer
16 years 28 days ago
Deterministic Calibration and Nash Equilibrium
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
Sham Kakade, Dean P. Foster
FLAIRS
2006
15 years 9 months ago
An Artificial Neural Network for a Tank Targeting System
In this paper, we apply artificial neural networks to control the targeting system of a robotic tank in a tank-combat computer game (RoboCode). We suggest an algorithm that not on...
Hans W. Guesgen, Xiao Dong Shi