Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Unendliches Spiel"'
With infinite horizon, optimal rules for sequential search from a known distribution feature a constant reservation value that is independent of whether recall of past options is possible. We extend this result to the the case when there are multiple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97766543553ea76ca1d9b0b76fafa7d5
https://www.zora.uzh.ch/id/eprint/139697/
https://www.zora.uzh.ch/id/eprint/139697/
Autor:
Gelderie, Marcus
Publikováno v:
Aachen II, 195 S. : graph. Darst. (2014). = Aachen, Techn. Hochsch., Diss., 2014
This thesis studies the representation of winning strategies in infinite games as Turing machines. We show that Turing-machine-based strategy representation (by "strategy machines") - if compared to the standard setting of Mealy automata - allows for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::ab54e149daf809f61435ad47da5a974f
Autor:
Repke, Stefan
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University VII, 93 S. : graph. Darst. (2014). = Aachen, Techn. Hochsch., Diss., 2014
Automata simplification asks whether a given automaton can be converted into one of a simpler format, i.e., whether a certain feature of the automaton model is avoidable in the given case.If yes, an automaton of this simpler format shall be synthesiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::3c6f4e36041b8ba29c24b895263eee8e
Autor:
Fridman, Wladimir
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University IX, 155 S. : graph. Darst. (2013). = Aachen, Techn. Hochsch., Diss., 2013
Infinite two-player games are of interest in computer science since they provide an algorithmic framework for the study of nonterminating reactive systems. Usually, an infinite game is specified by an ω-language containing all winning plays for one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::dd22f9ac8fa794899c715376b2d50822
https://publications.rwth-aachen.de/record/210437
https://publications.rwth-aachen.de/record/210437
Autor:
Puchala, Bernd
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University 260 S. : graph. Darst. (2013). = Aachen, Techn. Hochsch., Diss., 2013
This work adresses the strategy problem for multiplayer games with imperfect information which are of infinite duration and have (up to) contextfree winning conditions. A particular focus is on applications to synthesis of controllers for nonterminat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::95995830073595dd678bf01cb2344b3f
Autor:
Olschewski, Jörg
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University VI, 117 S. : graph. Darst. (2013). = Aachen, Techn. Hochsch., Diss., 2013
The theory of two-player infinite games provides a framework for studying the controller synthesis problem in reactive system. This problem was solved for regular winning conditions for the first time by the fundamental Büchi-Landweber Theorem. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::e116035d5befb24cb7a3cc793e71748d
https://publications.rwth-aachen.de/record/229420
https://publications.rwth-aachen.de/record/229420
Autor:
Holtmann, Michael
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University X, 147 S. : graph. Darst. (2011). = Aachen, Techn. Hochsch., Diss., 2011
Infinite two-player games constitute a powerful and flexible framework for the design and verification of reactive systems. It is well-known that, for example, the construction of a controller acting indefinitely within its environment can be reduced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::03146a991be6e22541e307c1efbb61e3
Autor:
Slaats, Michaela
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University VI, 141 S. : graph. Darst. (2011). = Aachen, Techn. Hochsch., Diss., 2011
Higher-order pushdown systems extend the idea of pushdown systems by using a "higher-order stack" (which is a nested stack). More precisely on level 1 this is a standard stack, on level 2 it is a stack of stacks, and so on. We study the higher-order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::00604f341fa0a6fed044bf1c5eddf7c1
Autor:
Ummels, Michael
Publikováno v:
Amsterdam : Pallas Publ. 174 S. : graph. Darst. (2010). = Zugl.: Aachen, Techn. Hochsch., Diss., 2010
Stochastic games provide a versatile model for reactive systems that are affected by random events. Intuitively, a play of such a game evolves by moving a token along the edges of a directed graph. Each vertex of the graph is either controlled by one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::ab8cdc72b60804a6e440a4ef8ab2e115
https://publications.rwth-aachen.de/record/63898
https://publications.rwth-aachen.de/record/63898