Sciweavers

13784 search results - page 389 / 2757
» On Computing Functions with Uncertainty
Sort
View
HYBRID
2010
Springer
15 years 12 months ago
A generating function approach to the stability of discrete-time switched linear systems
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...
Jianghai Hu, Jinglai Shen, Wei Zhang
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
15 years 11 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
ISLPED
1996
ACM
102views Hardware» more  ISLPED 1996»
15 years 11 months ago
High-level power estimation and the area complexity of Boolean functions
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
Mahadevamurty Nemani, Farid N. Najm
ESANN
2003
15 years 8 months ago
Neural networks organizations to learn complex robotic functions
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
DAC
2004
ACM
16 years 7 months ago
A method to decompose multiple-output logic functions
This paper shows a method to decompose a given multipleoutput circuit into two circuits with intermediate outputs. We use a BDD for characteristic function (BDD for CF) to represe...
Tsutomu Sasao, Munehiro Matsuura