受强制性开放获取政策约束的文章 - Pierre Vandenhove了解详情
可在其他位置公开访问的文章：7 篇
Games where you can play optimally with arena-independent finite memory
P Vandenhove, M Randour, Y Oualhadj, S Le Roux, P Bouyer
Logical Methods in Computer Science 18, 11:1-11:44, 2022
强制性开放获取政策： National Fund for Scientific Research, Belgium
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
P Vandenhove, M Randour, P Bouyer
TheoretiCS 2, 1-48, 2023
强制性开放获取政策： National Fund for Scientific Research, Belgium, Agence Nationale de la Recherche
Arena-Independent Finite-Memory Determinacy in Stochastic Games
P Bouyer, Y Oualhadj, M Randour, P Vandenhove
Logical Methods in Computer Science 19, 18:1-18:51, 2023
强制性开放获取政策： National Fund for Scientific Research, Belgium, Agence Nationale de la Recherche
Half-Positional Objectives Recognized by Deterministic Büchi Automata
P Bouyer, A Casares, M Randour, P Vandenhove
Logical Methods in Computer Science 20, 19:1-19:42, 2024
强制性开放获取政策： Agence Nationale de la Recherche
Decisiveness of stochastic systems and its application to hybrid models
P Bouyer, T Brihaye, M Randour, C Rivière, P Vandenhove
Information and Computation, 104861, 2021
强制性开放获取政策： National Fund for Scientific Research, Belgium, Agence Nationale de la Recherche
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk)
P Bouyer, M Randour, P Vandenhove
42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022
强制性开放获取政策： National Fund for Scientific Research, Belgium, Agence Nationale de la Recherche
A positional -complete objective
A Casares, P Ohlmann, P Vandenhove
arXiv preprint arXiv:2410.14688, 2024
强制性开放获取政策： Agence Nationale de la Recherche, Narodowe Centrum Nauki
出版信息和资助信息由计算机程序自动确定