1716 search results - page 209 / 344 » Proving Conditional Termination |
111
click to vote
ICML
1998
IEEE
16 years 1 months ago
1998
IEEE
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
106
click to vote
ICML
1998
IEEE
16 years 1 months ago
1998
IEEE
This paper presents a new approach to hierarchical reinforcement learning based on the MAXQ decomposition of the value function. The MAXQ decomposition has both a procedural seman...
CADE
2006
Springer
16 years 1 months ago
2006
Springer
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
PODS
2004
ACM
16 years 1 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
141
click to vote
TACAS
2010
Springer
15 years 8 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...