48 search results - page 5 / 10 » Interpolant-Based Transition Relation Approximation |
103
click to vote
MP
2010
14 years 8 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
NIPS
1998
14 years 11 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
KI
2009
Springer
15 years 4 months ago
2009
Springer
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
CSFW
2007
IEEE
15 years 3 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
CAV
2001
Springer
15 years 2 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...