Sciweavers

1884 search results - page 40 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
COLT
2005
Springer
15 years 1 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour
93
Voted
AAAI
1996
15 years 1 months ago
Exploiting Graph Properties of Game Trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 3 months ago
Modeling Urgency in Component-Based Real-Time Systems
A component-based realtime system is a simple model for the server-client relation with time constraints. This paper presents an efficient algorithm, called a blackbox testing algo...
Nguyen Van Tang, Dang Van Hung, Mizuhito Ogawa
AAI
2010
195views more  AAI 2010»
14 years 8 months ago
Automatic Extraction of Go Game Positions from Images: a Multi-Strategical Approach to Constrained Multi-Object Recognition
Here, we present a constrained object recognition task that has been robustly solved largely with simple machine learning methods, using a small corpus of about 100 images taken u...
Alexander K. Seewald
TCIAIG
2010
14 years 6 months ago
Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...
Jean Méhat, Tristan Cazenave