Zobrazeno 1 - 10
of 16
pro vyhledávání: '"hierarchical decompositions"'
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:
CDC
2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
The Control-Coding Capacity (CC Capacity) is defined as the maximum amount of information in bits/second, which can be encoded into randomized control strategies, transmitted over the control system, and decoded at its outputs, with arbitrary asympto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20732996867780e5fb640f45c0573af6
https://doi.org/10.1109/cdc.2017.8263637
https://doi.org/10.1109/cdc.2017.8263637
Autor:
Takahiro Akita, Sachiko Miyata
Publikováno v:
Letters in Spatial and Resource Sciences. 6:137-150
This paper analyzes the roles of location (rural and urban sectors) and education in the distribution of economic well-being in Indonesia by employing the hierarchical and non-hierarchical decomposition methods of the Theil indices. This is done by u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e29fc81839de92df01c7a290f234f53
https://doi.org/10.1007/s12076-013-0093-8
https://doi.org/10.1007/s12076-013-0093-8
Autor:
Irene Finocchi, Rossella Petreschi
Publikováno v:
Discrete Applied Mathematics. 136:227-247
We present algorithms for computing hierarchical decompositions of trees satisfying different optimization criteria, including balanced cluster size, bounded number of clusters, and logarithmic depth of the decomposition. Furthermore, every high-leve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49a86cb046e4b01432656b19fee71cbf
https://doi.org/10.1016/s0166-218x(03)00443-8
https://doi.org/10.1016/s0166-218x(03)00443-8
Publikováno v:
Brodal, G S, Fagerberg, R & Pedersen, C N S 2003, ' Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n) ', Algorithmica, vol. 38, no. 2, pp. 377-395 . https://doi.org/10.1007/s00453-003-1065-y
Udgivelsesdato: November Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is therefore an important task. The quartet distance is a distanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2270897f13572df9b50e6969de760a32
https://doi.org/10.1007/s00453-003-1065-y
https://doi.org/10.1007/s00453-003-1065-y
Publikováno v:
Economics & Management Series.
This paper analyzes the roles of location (rural and urban sectors) and education in the distribution of economic well-being in Indonesia by employing the hierarchical and non-hierarchical decomposition methods of the Theil indices. This is done by u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::b624a423eb9f28be3b2ee46504d615fd
http://id.nii.ac.jp/1509/00000489/
http://id.nii.ac.jp/1509/00000489/
Publikováno v:
9th European Workshop on Reinforcement Learning, EWRL 2011
Lect. Notes Comput. Sci.
Lect. Notes Comput. Sci.
This paper compares and investigates single-agent reinforcement learning (RL) algorithms on the simple and an extended taxi problem domain, and multiagent RL algorithms on a multiagent extension of the simple taxi problem domain we created. In partic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4485::f483ee938c4b1564d8c98f737d0c410e
http://gnosis.library.ucy.ac.cy/handle/7/54355
http://gnosis.library.ucy.ac.cy/handle/7/54355
Autor:
Kagan Gokbayrak
Publikováno v:
Discrete Event Dynamic Systems
Discrete Event Dynamic Systems: Theory and Applications
Discrete Event Dynamic Systems: Theory and Applications
We consider a single-stage hybrid manufacturing system where jobs arrive according to a Poisson process. These jobs undergo a deterministic process which is controllable. We define a stochastic hybrid optimal control problem and decompose it hierarch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b93434cb9ac9c0a139fbfa6841d53c8
https://hdl.handle.net/11693/12269
https://hdl.handle.net/11693/12269
Autor:
Egri-Nagy, A., Nehaniv, C.L.
“The original publication is available at www.springerlink.com”. Copyright Springer
Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the
Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______882::3383181cd55d1a581e7dafb28f341c53
http://hdl.handle.net/2299/5576
http://hdl.handle.net/2299/5576
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.