Results 121 to 130 of about 2,051,541 (361)

The Complexity of Planning Revisited - A Parameterized Analysis [PDF]

open access: yes, 2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following research in planning in many ways. We go back and reanalyse their subclasses,
Baeckstroem, Christer   +4 more
core  

On the complexity of computing the $k$-restricted edge-connectivity of a graph

open access: yes, 2016
The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices.
A Holtkamp   +20 more
core   +1 more source

Parameterized Complexity of Weighted Team Definability [PDF]

open access: green, 2023
Juha Kontinen   +3 more
openalex   +1 more source

Interfacial Behavior of Methane in Methane/p‐Xylene/Water Systems: First Principles Inspected Using Neutron Imaging and Molecular Dynamics Simulations

open access: yesAdvanced Materials Interfaces, EarlyView.
Pressurized gases reduce interfacial tension (IFT) at the gas‐liquid interfaces, their influence on the liquid–liquid interfaces remains unclear. For model compounds methane, water, and p‐xylene, neutron imaging observation of pressurized three‐phase systems is combined with Molecular Dynamics simulations.
Martin Melčák   +8 more
wiley   +1 more source

Phase Diagrams Enable Solid‐State Battery Design

open access: yesAdvanced Materials Interfaces, EarlyView.
Batteries are non‐equilibrium devices with inherent thermodynamic driving forces to react at interfaces, regardless of kinetics or operating conditions. Chemical potential mismatches across interfaces are dissipated via interfacial reactions. In this work, it is illustrated how phase diagrams and chemical potential maps predict degradation pathways but
Nathaniel L. Skeele, Matthias T. Agne
wiley   +1 more source

Searching and Indexing Genomic Databases via Kernelization

open access: yesFrontiers in Bioengineering and Biotechnology, 2015
The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes.
Travis eGagie, Simon ePuglisi
doaj   +1 more source

Parameterized Complexity of Asynchronous Border Minimization

open access: yes, 2015
Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimization Problem (BMP) and the Border Minimization Problem with given ...
A Frank   +16 more
core   +1 more source

Parameterized Complexity of Untangling Knots

open access: yesSIAM Journal on Computing
Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized complexity of this problem with respect to a natural parameter called defect.
Legrand-Duchesne, Clément   +2 more
openaire   +4 more sources

Fluctuating Curvature and Actuation in 4D Printed Asymmetric Networks by Frontal Photopolymerization

open access: yesAdvanced Materials Interfaces, EarlyView.
Asymmetric polymer networks, fabricated by frontal photopolymerization (FPP), are shown to exhibit curvature oscillations associated with monomer‐solvent exchanges during development and drying. We introduce a theoretical model for such dynamic curvature fluctuations and demonstrate the fabrication of bistable switches and self‐propelled materials that
Muhammad Ghifari Ridwan   +3 more
wiley   +1 more source

Parameterized Complexity Results for Plan Reuse

open access: yes, 2013
Planning is a notoriously difficult computational problem of high worst-case complexity. Researchers have been investing significant efforts to develop heuristics or restrictions to make planning practically feasible.
de Haan, Ronald   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy