no code implementations • 14 Dec 2023 • Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak
Regular decision processes (RDPs) are a subclass of non-Markovian decision processes where the transition and reward functions are guarded by some regular property of the past (a lookback).
no code implementations • 14 Aug 2023 • Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak
Reinforcement learning (RL) is a powerful approach for training agents to perform tasks, but designing an appropriate reward mechanism is critical to its success.
no code implementations • 8 Jun 2023 • Yanhua Xu, Dominik Wojtczak
In this study, we propose a multi-channel neural network model to predict the host and antigenic subtypes of influenza A viruses from hemagglutinin and neuraminidase protein sequences.
no code implementations • 28 Jul 2022 • Yanhua Xu, Dominik Wojtczak
Influenza viruses mutate rapidly and can pose a threat to public health, especially to those in vulnerable groups.
no code implementations • 23 Jun 2022 • Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak
Recursion is the fundamental paradigm to finitely describe potentially infinite objects.
no code implementations • 8 Jun 2022 • Yanhua Xu, Dominik Wojtczak
In this work, we propose multi-channel neural networks to predict antigenic types and hosts of influenza A viruses with hemagglutinin and neuraminidase protein sequences.
no code implementations • 6 May 2022 • Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak
The surprising answer is that we have to pay significantly less when we instead expand the good-for-MDP property to alternating automata: like the nondeterministic GFM automata obtained from deterministic Rabin automata, the alternating good-for-MDP automata we produce from deterministic Streett automata are bi-linear in the the size of the deterministic automaton and its index, and can therefore be exponentially more succinct than minimal nondeterministic B\"uchi automata.
no code implementations • 4 Jan 2022 • Yanhua Xu, Dominik Wojtczak
The MCC obtained using the model with word embedding is around 96%, and the F1 is around 97%.
no code implementations • 16 Jun 2021 • Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak
Reinforcement learning synthesizes controllers without prior knowledge of the system.
no code implementations • 12 Jun 2021 • Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak
We study reinforcement learning for the optimal control of Branching Markov Decision Processes (BMDPs), a natural extension of (multitype) Branching Markov Chains (BMCs).
no code implementations • 23 Mar 2021 • Bart de Keijzer, Dominik Wojtczak
We study this problem both in the offline setting and online setting.
no code implementations • 18 Jan 2021 • Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
We study stochastic games with energy-parity objectives, which combine quantitative rewards with a qualitative $\omega$-regular condition: The maximizer aims to avoid running out of energy while simultaneously satisfying a parity condition.
Computer Science and Game Theory Logic in Computer Science
no code implementations • 22 Jul 2019 • Krzysztof R. Apt, Dominik Wojtczak
To establish these results we showed that both the definition of semantics and of truth of the underlying logic are decidable.
no code implementations • 26 Feb 2018 • Dominik Wojtczak
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers.
no code implementations • 27 Jul 2017 • Krzysztof R. Apt, Dominik Wojtczak
This implies that implementability, partial correctness and termination of distributed epistemic gossip protocols that use non-nested common knowledge operator is decidable, as well.