437 search results - page 34 / 88 » Proving Termination by Divergence |
155
click to vote
FMCAD
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
178
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
169
click to vote
FORTE
2009
15 years 3 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
161
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
161
click to vote
CALCO
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...