Sciweavers

3007 search results - page 179 / 602
» Linear Functional Fixed-points
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 3 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
140
Voted
MCS
2008
Springer
15 years 3 months ago
On the stability analysis of nonlinear systems using polynomial Lyapunov functions
In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist posi...
Hajer Bouzaouache, Naceur Benhadj Braiek
149
Voted
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 3 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
CDC
2009
IEEE
379views Control Systems» more  CDC 2009»
15 years 6 months ago
Receding horizon cost optimization for overly constrained nonlinear plants
— A receding horizon control algorithm, originally proposed for tracking best-possible steady-states in the presence of overly stringent state and/or input constraints, is analyz...
David Angeli, Rishi Amrit, James B. Rawlings
CAGD
2008
82views more  CAGD 2008»
15 years 3 months ago
On rationally supported surfaces
We analyze the class of surfaces which are equipped with rational support functions. Any rational support function can be decomposed into a symmetric (even) and an antisymmetric (...
Jens Gravesen, Bert Jüttler, Zbynek Sí...