Temat: completeness - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Pointwise completeness and pointwise degeneracy of 2D standard and positive Fornasini-Marchesini models with state-feedbacks
Autorzy:: Kaczorek, T.
Powiązania:: https://bibliotekanauki.pl/articles/205641.pdf
Data publikacji:: 2011
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: pointwise completeness
standard
state-feedbacks
Opis:: Necessary and sufficient conditions are established for the pointwise completeness of 2D standard and positive Fornasini-Marchesini models with state-feedbacks. Similar relations are obtained for the pointwise degeneracy of the 2D models with state-feedbacks. It is shown that if the positive 2D model is pointwise complete then there exists a gain matrix of the state-feedback such that the closed-loop system is pointwise degenerated if both matrices B1 and B2 of the 2D Fornasini-Marchesini model are nonzero. The considerations are illustrated by numerical examples.
Źródło:: Control and Cybernetics; 2011, 40, 1; 39-58
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The smallest hard-to-color graphs for the classical, total and strong colorings of vertices
Autorzy:: Kubale, M.
Manuszewski, K.
Powiązania:: https://bibliotekanauki.pl/articles/206254.pdf
Data publikacji:: 1999
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: optymalizacja
teoria grafów
złożoność obliczeniowa
benchmark
chromatic number
chromatic sum
graph oring
hard-to-color graph
NP-completeness
strong coloring
Opis:: : Let A(G) be the number of colors used by algorithm to color the vertices of graph G. A graph G is said to be hard-to-color (HC) (resp. slightly HC) if for every (resp. some) implementation of the algorithm A we have A(G) > chi(G), where chi(G) is the chromatic number of G. The study of HC graphs makes it possible design improved algorithms trying to avoid hard instances as far possible. Hard-to-color graphs are also good benchmarks for the evaluation of existing and future algorithms and provide an alternative way of assessing their quality. In this paper we demonstrate the smallest HC graphs for the best known coloring heuristics in classical applications, as well as when adapted to the chromatic sum coloring and strong coloring of vertices.
Źródło:: Control and Cybernetics; 1999, 28, 2; 355-365
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja