Sciweavers

10997 search results - page 40 / 2200
» On the Structure of Complete Sets
Sort
View
AAAI
1998
13 years 11 months ago
Discovering Admissible Simultaneous Equations of Large Scale Systems
SSFisasystemtodiscoverthestructureofsimultaneous equations governing an objective process through experiments. SSF combined with another system SDS to discover a quantitative form...
Takashi Washio, Hiroshi Motoda
CIE
2007
Springer
14 years 4 months ago
A Useful Undecidable Theory
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 ...
Victor L. Selivanov
JSC
2010
82views more  JSC 2010»
13 years 4 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
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...
Sonia L. Rueda, J. Rafael Sendra
ACL
1993
13 years 11 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
ICCD
1991
IEEE
65views Hardware» more  ICCD 1991»
14 years 1 months ago
Self-Timed Logic Using Current-Sensing Completion Detection (CSCD)
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
Mark E. Dean, David L. Dill, Mark Horowitz