9842 search results - page 1531 / 1969 » The Complexity of the Matching-Cut Problem |
175
click to vote
ACL
1997
15 years 8 months ago
1997
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
173
click to vote
ACL
1997
15 years 8 months ago
1997
We present preliminary results concerning robust techniques for resolving bridging definite descriptions. We report our analysis of a collection of 20 Wall Street Journal articles...
188
click to vote
DSL
1997
15 years 8 months ago
1997
In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distrib...
191
click to vote
IJCAI
1997
15 years 8 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
208
click to vote
SPLC
2000
15 years 8 months ago
2000
: Framelets and implementation cases are new concepts to manage the complexity of product line development. Framelets are "small product lines" that address, as self-stan...