1753 search results - page 238 / 351 » Reducibility of domain representations and Cantor-Weihrauch ... |
AAAI
1993
14 years 11 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
AAMAS
2007
Springer
14 years 10 months ago
2007
Springer
We describe our preliminary work in modeling conversation specifications and policies as positive/negative permissions and obligations. Our model is generic as it is independent o...
ENTCS
2008
14 years 10 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
ETS
2006
IEEE
14 years 10 months ago
2006
IEEE
Typically, most research and academic institutions own and archive a great amount of objects and research related resources that have been produced, used and maintained over long ...
101
click to vote
JODS
2006
14 years 10 months ago
2006
While providing a uniform syntax and a semistructured data model, XML does not express semantics but only structure such as nesting information. In this paper, we consider the prob...