3424 search results - page 206 / 685 » Automated Testing of Classes |
175
click to vote
AAAI
2007
15 years 9 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
142
click to vote
CBSE
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. This paper discusses various classifications of component interoperability errors.These classifications aim at supporting the automation of component adaptation. The us...
236
click to vote
ALP
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
190
click to vote
TPHOL
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
160
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...