Zobrazeno 1 - 10
of 653
pro vyhledávání: '"T&K"'
Autor:
Campbell, Al1
Publikováno v:
International Journal of Cuban Studies. Summer2024, Vol. 16 Issue 1, p140-142. 3p.
Publikováno v:
Stats, Vol 7, Iss 1, Pp 138-159 (2024)
Shannon’s entropy is a fundamental concept in information theory that quantifies the uncertainty or information in a random variable or data set. This article addresses the estimation of Shannon’s entropy for the Maxwell lifetime model based on p
Externí odkaz:
https://doaj.org/article/3346bbdbbd1b4bef9143588833623d8b
Publikováno v:
Administration (0001-8325). Feb2017, Vol. 65 Issue 1, p99-103. 5p.
Autor:
Smith, T. K.1
Publikováno v:
Vital Speeches of the Day. 8/1/86, Vol. 52 Issue 20, p622-625. 4p.
Publikováno v:
Sensors, Vol 24, Iss 7, p 2303 (2024)
As multiprocessor systems continue to grow in processor scale, the incidence of faults also increases. As a result, fault diagnosis is becoming a key mechanism for maintaining the normal operation of multiprocessor systems. To explore more effective
Externí odkaz:
https://doaj.org/article/36662e5d3bd548189fe03077ada1f747
Autor:
BARRY, FRANK1, DALY, MARY E.2
Publikováno v:
Economic & Social Review. Summer2011, Vol. 42 Issue 2, p159-168. 10p.
Autor:
Turner, Barry A.1
Publikováno v:
Organization Studies. 1984, Vol. 5 Issue 3, p269. 8p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dilbarjot, Gosselin Shonda Dueck
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 747-758 (2022)
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permut
Externí odkaz:
https://doaj.org/article/5a31a1e89a794b2ebd2e00cbb7b4c7df