Picture for Johannes Schmidt

Johannes Schmidt

University of Natural Resources and Life Sciences, Vienna

Learning Tree Pattern Transformations

Add code
Oct 10, 2024
Figure 1 for Learning Tree Pattern Transformations
Viaarxiv icon

Computational Performance of Deep Reinforcement Learning to find Nash Equilibria

Add code
Apr 26, 2021
Figure 1 for Computational Performance of Deep Reinforcement Learning to find Nash Equilibria
Figure 2 for Computational Performance of Deep Reinforcement Learning to find Nash Equilibria
Figure 3 for Computational Performance of Deep Reinforcement Learning to find Nash Equilibria
Figure 4 for Computational Performance of Deep Reinforcement Learning to find Nash Equilibria
Viaarxiv icon

Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework

Add code
Feb 23, 2021
Figure 1 for Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
Viaarxiv icon

Machine learning models show similar performance to Renewables.ninja for generation of long-term wind power time series even without location information

Add code
Dec 09, 2019
Figure 1 for Machine learning models show similar performance to Renewables.ninja for generation of long-term wind power time series even without location information
Figure 2 for Machine learning models show similar performance to Renewables.ninja for generation of long-term wind power time series even without location information
Figure 3 for Machine learning models show similar performance to Renewables.ninja for generation of long-term wind power time series even without location information
Figure 4 for Machine learning models show similar performance to Renewables.ninja for generation of long-term wind power time series even without location information
Viaarxiv icon

On the Parameterized Complexity of Default Logic and Autoepistemic Logic

Add code
Oct 06, 2011
Figure 1 for On the Parameterized Complexity of Default Logic and Autoepistemic Logic
Viaarxiv icon

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

Add code
Jun 28, 2010
Figure 1 for Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Figure 2 for Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Viaarxiv icon