Results 81 to 90 of about 2,051,541 (361)
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
Parameterized complexity of a coupled-task scheduling problem
Journal of Scheduling, 2018 Stéphane Bessy, Rodolphe Giroudeau
openalex +3 more sources
Arthritis Care &Research, EarlyView.Objective 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 the trajectory of a ...
Ji Soo Kim +18 more
wiley +1 more source
Adaptable Tile‐Based Pneumatic Origami through Structurally Coupled Localized Actuation
Advanced Engineering Materials, EarlyView.This article presents tile‐based pneumatic origami structures with rigid tiles and flexible fabric creases, achieving adaptable properties including morphing shape, selective multistability, and tunable stiffness. Independently pressurized folding bladders at each crease enable structurally coupled localized actuation of origami structures.
Tiantian Li, Jonathan Luntz, Diann Brei
wiley +1 more source
Parameterized Complexity of the k-anonymity Problem
, 2010 The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity.
A Gionis +21 more
core +1 more source
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
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs: $H\in \mathcal ...
M. Roth, Philip Wellnitz
semanticscholar +1 more source
Advanced Engineering Materials, EarlyView.A two‐step approach combining laser powder bed fusion of FeSi electrical steel with Bakelite infiltration enables the fabrication of multifunctional gyroid lattice composites. The resulting structures exhibit high strength, magnetic anisotropy, and complete polymer infiltration, demonstrating a simple and scalable route toward lightweight, mechanically
Angelo F. Andreoli +9 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
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