Results 61 to 70 of about 128,668 (237)
The Parameterized Complexity of the Minimum Shared Edges Problem [PDF]
, 2015 We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k
Fluschnik, Till +3 more
core +2 more sources
Parameterized complexity of fair deletion problems
, 2017 Deletion problems are those where given a graph $G$ and a graph property $\pi$, the goal is to find a subset of edges such that after its removal the graph $G$ will satisfy the property $\pi$. Typically, we want to minimize the number of elements removed.
Masařík, Tomáš, Toufar, Tomáš
core +1 more source
The Parameterized Complexity of the Equidomination Problem [PDF]
, 2017 A graph $G=(V,E)$ is called equidominating if there exists a value $t \in \mathbb{N}$ and a weight function $ : V \rightarrow \mathbb{N}$ such that the total weight of a subset $D\subseteq V$ is equal to $t$ if and only if $D$ is a minimal dominating set.
Oliver Schaudt, Fabian Senger
openaire +2 more sources
Arthritis Care &Research, Accepted Article.Background In complex diseases, it is challenging to assess a patient's disease state, trajectory, treatment exposures, and risk of multiple outcomes simultaneously, efficiently and at the point of care. Methods We developed an interactive patient‐level data visualization and analysis tool (VAT) that automates illustration of a scleroderma patient's ...
Ji Soo Kim +18 more
wiley +1 more source
IEEE Access, 2022 The relaxation method of Tuan et al. (2001, Theorem 2.2) has been used in various studies to deal with parameterized linear matrix inequalities (PLMIs) without excessively increasing computational complexity.
Sung Hyun Kim
doaj +1 more source
Parameterized Complexity of Graph Constraint Logic [PDF]
, 2015 Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions.
van der Zanden, Tom C.
core +2 more sources
Quantum Parameterized Complexity
, 2022 23 pages, 1 ...
Bremner, Michael J. +5 more
openaire +2 more sources
International Journal of Adaptive Control and Signal Processing, EarlyView.Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva +4 more
wiley +1 more source
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
Algorithms, 2016 Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them.
Henrik Björklund +2 more
doaj +1 more source
Parameterized complexity of DPLL search procedures [PDF]
, 2011 We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems.
A. Haken +22 more
core +3 more sources