644 search results - page 22 / 129 » Decomposition Complexity |
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
120
click to vote
AIPS
1994
15 years 3 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
125
click to vote
ICCAD
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
131
Voted
AISC
2010
Springer
15 years 7 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...