๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Robust priority assignment for messages on

โœ Scribed by Robert I. Davis; Alan Burns

Publisher
Springer US
Year
2008
Tongue
English
Weight
661 KB
Volume
41
Category
Article
ISSN
0922-6443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On eigenstructure assignment for robust
On eigenstructure assignment for robust fault diagnosis
โœ Ron J. Patton; Jie Chen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB

This paper presents a theoretical and tutorial treatment of the eigenstructure assignment approach for robust fault detection. The principles, existence conditions and design procedures are presented. The main contribution of the paper is the development of the assignment of right observer eigenvect

Priority assignment for convergence type
Priority assignment for convergence type multimedia communication
โœ Mohammad Reza; Katsunori Yamaoka; Yoshinori Sakai ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 238 KB

This paper considers convergence type multimedia communication, where packet communications are executed concurrently from multiple information sources to a single destination node and discusses the priority assignment method for each link in each communication path. As the first step, the degradati

Robust eigenvalue assignment for general
Robust eigenvalue assignment for generalized systems
โœ V.L. Syrmos; F.L. Lewis ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 539 KB

In this paper we examine the problem of robust pole placement using state-feedback in generalized systems. We develop a robustness theory for the finite generalized spectrum of the system as a partial problem, and for the "infinite" pole placement problem as a second partial problem where perfect co

Robust taboo search for the quadratic as
Robust taboo search for the quadratic assignment problem
โœ E. Taillard ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 635 KB

Taillard, E., Robust taboo search for the quadratic assignment problem, Parallel Computing 17 (1991) 443-455. An adaptation of taboo search to the quadratic assignment problem is discussed in this paper This adaptation is efficient and robust, requiring less complexity and fewer parameters than ear