Zobrazeno 1 - 10
of 440
pro vyhledávání: '"recursive set"'
Publikováno v:
IEEE Sensors Journal. 21:26175-26185
In most of the existing localization schemes based on received signal strength indicator (RSSI), the target location is calculated based on typical parameters and the statistical information of measurement noise is needed. This article addresses thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97873142df3ca4adbb448c80ca483490
https://doi.org/10.1109/jsen.2021.3118536
https://doi.org/10.1109/jsen.2021.3118536
Autor:
Emmanuel Rauzy
Publikováno v:
Journal of Group Theory. 25:217-246
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth function and solv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0edecc986258a660a8166aaa8742c34e
https://doi.org/10.1515/jgth-2020-0029
https://doi.org/10.1515/jgth-2020-0029
Autor:
Vasung, Patrik
U ovom dipomskom radu proučavamo izračunljive metričke prostore. Posebnu pažnju pridajemo takozvanim efektivno kompaktnim izračunljivim metričkim prostorima. U prvom poglavlju obrađujemo teoriju izračunljivosti. Uvodimo pojam rekurzivne funkc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3908::51a3eedc5b1e3ab57f538eeef0bb4c0d
https://repozitorij.pmf.unizg.hr/islandora/object/pmf:10741
https://repozitorij.pmf.unizg.hr/islandora/object/pmf:10741
Autor:
Ronald Paxton-Sheets Mahler
Publikováno v:
IEEE Access, Vol 9, Pp 68663-68674 (2021)
Conventional single-point-target tracking algorithms are recursive point estimators with point-measurement input data. In less well-known approaches, the tracking algorithm is a recursive set estimator with point-measurement or set-measurement input
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::352ce4619cd1ea81ae77099eb5347823
https://ieeexplore.ieee.org/document/9422717/
https://ieeexplore.ieee.org/document/9422717/
Autor:
Carlos E. Valero, Radoslav Paulen
Publikováno v:
IFAC-Papers
In this paper the problem of robust output-feedback Model Predictive Control (MPC) is considered. Uncertainty in the state estimates obtained from noisy measurements is bounded using set-membership techniques as we consider the noise to be bounded. R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce81cac0f0c9561e1cba0ba7c1e03857
https://doi.org/10.1016/j.ifacol.2019.06.109
https://doi.org/10.1016/j.ifacol.2019.06.109
In this article, we investigate the set-membership state estimation problem for a class of time-varying systems with non-Gaussian noises over a FlexRay network. To mitigate the communication load and improve the flexibility of the data scheduling, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb9f612bbcd1ecec81e9a72c0552796f
https://bura.brunel.ac.uk/handle/2438/23530
https://bura.brunel.ac.uk/handle/2438/23530
Autor:
Lerman, Manuel
Publikováno v:
Transactions of the American Mathematical Society, 1974 Feb 01. 188, 341-386.
Externí odkaz:
https://www.jstor.org/stable/1996784
Autor:
Berry, John W.
Publikováno v:
Transactions of the American Mathematical Society, 1972 Feb 01. 164, 241-253.
Externí odkaz:
https://www.jstor.org/stable/1995971
Publikováno v:
Transactions of the Institute of Measurement and Control. 40:4185-4197
In this paper, set-membership parameter estimation of linear fractional-order systems is addressed for the case of unknown-but-bounded equation error. In such bounded-error context with a-priori known noise bounds, the main goal is to characterize th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5eff10ecd6a973a9faf27ed3e119acc
https://doi.org/10.1177/0142331217744853
https://doi.org/10.1177/0142331217744853
Autor:
Nikolay Bazhenov
Publikováno v:
Lobachevskii Journal of Mathematics. 38:600-614
We study complexity of isomorphisms between computable copies of lattices and Heyting algebras. For a computable ordinal α, the Δ α 0 dimension of a computable structure S is the number of computable copies of S, up to Δ α 0 computable isomorphi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04e7c75e94b1b6a3d6c69556080fbac0
https://doi.org/10.1134/s1995080217040035
https://doi.org/10.1134/s1995080217040035