Zobrazeno 1 - 10
of 1 676
pro vyhledávání: '"Space and time complexities"'
Publikováno v:
In Automatica December 2008 44(12):3014-3024
Publikováno v:
Automatica. 44:3014-3024
This work is concerned with system identification of plants using quantized output observations. We focus on relationships between identification space and time complexities. This problem is of importance for system identification in which data-flow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eec5b77ab55514d6f445ec7f48c82263
https://doi.org/10.1016/j.automatica.2008.04.022
https://doi.org/10.1016/j.automatica.2008.04.022
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.
Publikováno v:
Systems & Control: Foundations & Applications ISBN: 9780817649555
The number m0 of thresholds is a measure of space complexity, whereas the observation length N is a measure of time complexity that quantifies how fast uncertainty can be reduced. The significance of understanding space and time complexities can be i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5caaddced62f54e038189389de5c5cb
https://doi.org/10.1007/978-0-8176-4956-2_14
https://doi.org/10.1007/978-0-8176-4956-2_14
Kniha
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.
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 30, Iss 1, Pp 51-66 (2018)
A firewall is the core of a well defined network security policy. This paper presents an automata-based method to study firewall security policies. We first propose a procedure that synthesizes an automaton that describes a security policy given as a
Externí odkaz:
https://doaj.org/article/2afd0ac94a9844139340ae331953f9f5
Publikováno v:
ACM Transactions on Knowledge Discovery from Data; May2024, Vol. 18 Issue 4, p1-27, 27p
Autor:
Ferng-Ching Lin, Jiann-Cherng Shieh
Publikováno v:
Journal of Complexity. (4):365-378
A processor is balanced in carrying out a computation if its computing time equals its I/O time. When the computation bandwidth of a processor is increased, like when multiple processors are incorporated to form an array, the critical question is to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbdff58f48a97cba0c5a89af13aba995
Autor:
Mahzoon, Alireza, Drechsler, Rolf
Publikováno v:
Foundations & Trends in Electronic Design Automation; 2024, Vol. 14 Issue 3, p171-244, 74p
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 30, Iss 1, Pp 51-66 (2018)
A firewall is the core of a well defined network security policy. This paper presents an automata-based method to study firewall security policies. We first propose a procedure that synthesizes an automaton that describes a security policy given as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8dec505ba2fb96d8e0a4adbbb1f33986
https://doi.org/10.1016/j.jksuci.2016.11.008
https://doi.org/10.1016/j.jksuci.2016.11.008