Add to ORKGThe Tree Structured Decomposition is a promising approach for checking stability of systems with a large number of uncertain parameters. If a given system allows such a decomposition, then the value set can be constructed extremely fast. In the following algorithms are presented, which find tree structures of characteristic polynomials and transfer functions
AbstractA polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and...
Subject: Message-passing algorithms are a class of algorithms which can be used to estimate the loca...
Dans cette thèse, nous étudions les décompositions arborescentes qui satisfont certaines contraintes...
The tree structured decomposition is a promising approach for checking robust stability of systems w...
Robust stability problems arise, if a system dependds on uncertain parameters. For a large number l...
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
AbstractIn this paper, various optimality problems (such as the shortest route, most reliable route ...
The focus of this thesis is the concept of tree-decomposition. A tree-decomposition of a graph G is ...
A tree decomposition of a hypergraph is a construction that captures the graph's topological s...
The chapter covers methods for identifying islands of tractability for NP-hard combi-natorial proble...
In this note a survey is given of areas of systems and control where structured matrix problems are ...
Abstract. A new class of structured polynomial eigenproblems arising in the stability analysis of ti...
AbstractThis paper introduces the TREE/TREE∗ algorithm for computing minimal diagnoses for tree-stru...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
SIGLETIB Hannover: RO 802(1987,6) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Info...
AbstractA polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and...
Subject: Message-passing algorithms are a class of algorithms which can be used to estimate the loca...
Dans cette thèse, nous étudions les décompositions arborescentes qui satisfont certaines contraintes...
The tree structured decomposition is a promising approach for checking robust stability of systems w...
Robust stability problems arise, if a system dependds on uncertain parameters. For a large number l...
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
AbstractIn this paper, various optimality problems (such as the shortest route, most reliable route ...
The focus of this thesis is the concept of tree-decomposition. A tree-decomposition of a graph G is ...
A tree decomposition of a hypergraph is a construction that captures the graph's topological s...
The chapter covers methods for identifying islands of tractability for NP-hard combi-natorial proble...
In this note a survey is given of areas of systems and control where structured matrix problems are ...
Abstract. A new class of structured polynomial eigenproblems arising in the stability analysis of ti...
AbstractThis paper introduces the TREE/TREE∗ algorithm for computing minimal diagnoses for tree-stru...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
SIGLETIB Hannover: RO 802(1987,6) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Info...
AbstractA polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and...
Subject: Message-passing algorithms are a class of algorithms which can be used to estimate the loca...
Dans cette thèse, nous étudions les décompositions arborescentes qui satisfont certaines contraintes...