704 search results - page 113 / 141 » Computer Games and Economics Experiments |
163
click to vote
SENSYS
2006
ACM
15 years 7 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
100
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
119
click to vote
ICGA
2008
15 years 1 months ago
2008
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
142
click to vote
AI
1999
Springer
15 years 1 months ago
1999
Springer
In this paper, we first discuss the meaning of physical embodiment and the complexity of the environment in the context of multi-agent learning. We then propose a vision-based rei...
109
click to vote
APGV
2006
ACM
15 years 7 months ago
2006
ACM
Navigating through large virtual environments using a headmounted display (HMD) is difficult due to the spatial limitations of the tracking system. We conducted two experiments t...