10997 search results - page 40 / 2200 » On the Structure of Complete Sets |
153
click to vote
AAAI
1998
15 years 7 months ago
1998
SSFisasystemtodiscoverthestructureofsimultaneous equations governing an objective process through experiments. SSF combined with another system SDS to discover a quantitative form...
177
click to vote
CIE
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
186
click to vote
JSC
2010
15 years 1 months ago
2010
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
158
click to vote
ACL
1993
15 years 7 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
136
click to vote
ICCD
1991
IEEE
15 years 9 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...