6740 search results - page 735 / 1348 » Using Classification as a Programming Language |
191
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
191
click to vote
UM
2001
Springer
15 years 11 months ago
2001
Springer
Browsing- and querying-oriented schemes have long served as the principal techniques for software developers to locate software components from a component repository for reuse. Un...
212
click to vote
APLAS
2000
ACM
15 years 11 months ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
164
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
180
click to vote
TOOLS
1999
IEEE
15 years 11 months ago
1999
IEEE
In spite of the intense efforts of metrics researches, the impact of object-oriented software metrics is for the moment still quite reduced. The cause of this fact lies not in an ...