Zobrazeno 1 - 10
of 2 046
pro vyhledávání: '"Subset construction"'
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:
Widegren, Filip, Lagerqvist, Arvid
Multi-agent games and strategy synthesis within them is of great interest to several applications, for example robotics and manufacturing. The Multiplayer Knowledge Based Subset Construction (MKBSC) could be a useful tool for such strategy synthesis.
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-304736
Autor:
Gertjan van Noord
Publikováno v:
Computational Linguistics, Vol 26, Iss 1 (2021)
Externí odkaz:
https://doaj.org/article/3a4e7372971c4f129d6ed7530773b1b8
Autor:
van Noord, Gertjan
Publikováno v:
Proceedings of FSMNLP'98. International Workshop on Finite-State Methods in Natural Language Processing, pages 1-12, June 29 - July 1, 1998. Bilkent University. Ankara, Turkey.
The paper discusses the problem of determinising finite-state automata containing large numbers of epsilon-moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very large numbe
Externí odkaz:
http://arxiv.org/abs/cmp-lg/9804003
Autor:
Kuldeep Vayadande, Krisha Patel, Nikita Punde, Shreyash Patil, Srushti Nikam, Sudhanshu Pathrabe
Publikováno v:
International Journal of Computer Sciences and Engineering. 10:1-5
Autor:
Michele Dusi, Gianfranco Lamperti
Publikováno v:
Intelligent Decision Technologies ISBN: 9789811559242
KES-IDT
KES-IDT
A translated finite automaton (TFA) results from a translation of a deterministic finite automaton (DFA). A translation is based on a mapping from the alphabet of the DFA to a new alphabet, where each symbol in the original alphabet is substituted wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c90b64990b71d433ed670507fdd58756
http://hdl.handle.net/11379/532419
http://hdl.handle.net/11379/532419
Publikováno v:
Pocrnic, I, Lindgren, F, Tolhurst, D, Herring, WO & Gorjanc, G 2022, ' Optimised core subset construction for the APY model ', Centre for Statistics (CFS) Annual Conference, Edinburgh, United Kingdom, 14/06/22 .
We are entering the era of mega-scale genomics, which is causing computational issues for standard genomic evaluation models due to their cubic computational complexity. A number of scalable genomic evaluation models have been proposed, like the APY
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3094::2cf239fb912745d3bfe99099c7459986
https://hdl.handle.net/20.500.11820/918e02bb-a84a-4297-a942-55af20e869fe
https://hdl.handle.net/20.500.11820/918e02bb-a84a-4297-a942-55af20e869fe
Autor:
Johansson, Gustaf, Bergmark, Gustaf
Many real life problems can be modelled using multi-agent games played on finite graphs. When an agent cannot differentiate between game states, for example when a robot operates with a broken sensor, the game is classified as a game of imperfect inf
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319503