3455 search results - page 207 / 691 » Generalized Game Trees |
187
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
168
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
There is a large disparity between the rich physical interfaces of co-located arcade games and the generic input devices seen in most home console systems. In this paper we argue ...
178
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
179
click to vote
ROBOCUP
2000
Springer
15 years 10 months ago
2000
Springer
Self localization seems necessary for mobile robot navigation. The conventional method such as geometric reconstruction from landmark observations is generally time-consuming and ...
200
click to vote
DM
2002
15 years 6 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...