2128 search results - page 196 / 426 » A general characterization of indulgence |
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study neste...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
122
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
180
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
185
click to vote
ENTCS
2008
15 years 6 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...