1306 search results - page 46 / 262 » Strategy Acquisition for the Game |
121
Voted
JANCL
2007
15 years 21 days ago
2007
ABSTRACT. We formulate a formal framework in which we combine the theory of dynamic epistemic logic and the theory of games. In particular, we show how we can use tools of dynamic ...
106
click to vote
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
116
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
85
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
It is often expensive to acquire data in real-world data mining applications. Most previous data mining and machine learning research, however, assumes that a fixed set of trainin...
114
Voted
IJCAI
2007
15 years 2 months ago
2007
The goal of transfer learning is to use the knowledge acquired in a set of source tasks to improve performance in a related but previously unseen target task. In this paper, we pr...