166
click to vote
COCO
1991
Springer
15 years 8 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
122
click to vote
COCO
1991
Springer
15 years 8 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
191
click to vote
CAAP
1994
15 years 8 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
191
click to vote
CKEC
1991
15 years 8 months ago
1991
We propose in this paper a general framework for integrating inductive and case-based reasoning techniques for diagnosis tasks. We present a set of practical integrated approaches...
