Results 51 to 60 of about 1,864,097 (296)

Parameterized Complexity Results for Bayesian Inference [PDF]

open access: yes, 2022
We present completeness results for inference in Bayesian networks with respect to two different parameterizations, namely the number of variables and the topological vertex separation number.
Donselaar, Nils   +4 more
core  

Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors

open access: yesAlgorithms, 2020
This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to
Neeldhara Misra   +2 more
doaj   +1 more source

Taming the Chaos in Neural Network Time Series Predictions

open access: yesEntropy, 2021
Machine learning methods, such as Long Short-Term Memory (LSTM) neural networks can predict real-life time series data. Here, we present a new approach to predict time series data combining interpolation techniques, randomly parameterized LSTM neural ...
Sebastian Raubitzek, Thomas Neubauer
doaj   +1 more source

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

open access: yesAlgorithms, 2020
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann   +3 more
doaj   +1 more source

Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking.
Iris van de Pol   +2 more
doaj   +1 more source

The Parameterized Complexity of the Rainbow Subgraph Problem

open access: yesAlgorithms, 2015
The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner   +3 more
doaj   +1 more source

On the parameterized complexity of red-blue points separation

open access: yesJournal of Computational Geometry, 2019
We study the following geometric separation problem: Given a set $\mathcal R$ of red points and a set $\mathcal B$ of blue points in the plane, find a minimum-size set of lines that separate $\mathcal R$ from $\mathcal B$.
Edouard Bonnet   +2 more
doaj   +1 more source

On the Parameterized Complexity of Reconfiguration Problems [PDF]

open access: yesAlgorithmica, 2013
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence of {\em reconfiguration steps} that can be applied to transform $S$ into $T$ such that each step results in a ...
Amer E. Mouawad   +4 more
openaire   +3 more sources

A Brief Survey of Fixed-Parameter Parallelism

open access: yesAlgorithms, 2020
This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions.
Faisal N. Abu-Khzam, Karam Al Kontar
doaj   +1 more source

Describing Parameterized Complexity Classes

open access: yesInformation and Computation, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Flum, Martin Grohe
openaire   +5 more sources

Home - About - Disclaimer - Privacy