1641 search results - page 9 / 329 » Termination Analysis with Algorithmic Learning |
ICML
1990
IEEE
15 years 1 months ago
1990
IEEE
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
103
click to vote
CAV
2008
Springer
14 years 11 months ago
2008
Springer
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...
74
Voted
HIS
2008
14 years 11 months ago
2008
The problem of object recognition may be cast into a spatial grammar framework. This system comprises three novel elements: a spatial organisation of line features, an efficient t...