( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Validating Streaming JSON Documents with Learned VPAs.

, , и . TACAS (1), том 13993 из Lecture Notes in Computer Science, стр. 271-289. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Guillermo Pérez Hernández

Maria Dolores Pérez-Guzmán

Carmen Pérez Samaniego

Luis Alberto Pérez Moya

Héctor Luis Pérez Escalona

 

Другие публикации лиц с тем же именем

The Extended HOA Format for Synthesis.. CoRR, (2019)Learning Realtime One-Counter Automata., , и . TACAS (1), том 13243 из Lecture Notes in Computer Science, стр. 244-262. Springer, (2022)Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods., , , и . AAMAS, стр. 1354-1362. ACM, (2023)The complexity of reachability in parametric Markov decision processes., , , и . J. Comput. Syst. Sci., (2021)Graph-Based Reductions for Parametric and Weighted MDPs., , и . ATVA (1), том 14215 из Lecture Notes in Computer Science, стр. 137-157. Springer, (2023)The fixed initial credit problem for energy games with partial-observation is Ackermann-complete.. CoRR, (2015)When is Containment Decidable for Probabilistic Automata?., , , , , и . ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Impatient May Use Limited Optimism to Minimize Regret., , и . FoSSaCS, том 11425 из Lecture Notes in Computer Science, стр. 133-149. Springer, (2019)The Wasserstein Believer: Learning Belief Updates for Partially Observable Environments through Reliable Latent Space Models., , , , и . ICLR, OpenReview.net, (2024)Algorithms for Markov Binomial Chains., , , и . CoRR, (2024)