Results 61 to 70 of about 147,152 (326)

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 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, Kratsch, Stefan, Niedermeier, Rolf, Sorge, Manuel   +3 more
core   +2 more sources

Parameterized Complexity of Simultaneous Planarity

, 2023
Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all drawings coincide on $G$.
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter   +2 more
openaire   +2 more sources

Optimized Time–Frequency Analysis for Induction Motor Fault Detection Using Hybrid Differential Evolution and Deep Learning Techniques

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, Avyner Lorran de Oliveira Vitor, Marcelo Favoretto Castoldi, Alessandro Goedtel, Wesley Angelino Souza   +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, Martin Berglund, Petter Ericson   +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, A. Urquhart, B. Rossman, E. Ben-Sasson, G. Stalmark, J.A. Robinson, K. Amano, M. Alekhnovich, M. Davis, M. Davis, M.L. Bonet, M.L. Bonet, N. Segerlind, O. Beyersdorff, P. Beame, P. Beame, P. Beame, P.W. Beame, S. Janson, S.A. Cook, V. Chvátal, Y. Chen, Y. Gao   +22 more
core   +3 more sources

Parameterized complexity of MaxSat Above Average [PDF]

Theoretical Computer Science, 2012
In MaxSat, we are given a CNF formula $F$ with $n$ variables and $m$ clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let $r_1,..., r_m$ be the number of literals in the clauses of $F$. Then $asat(F)=\sum_{i=1}^m (1-2^{-r_i})$ is the expected number of clauses satisfied by a random truth assignment (the truth ...
Crowston, Robert, Gutin, Gregory, Jones, Mark, Raman, Venkatesh, Saurabh, Saket   +4 more
openaire   +2 more sources

Parameterized Complexity of $$(A,\ell )$$-Path Packing [PDF]

Algorithmica, 2020
AbstractGiven a graph $$G = (V,E)$$ G = ( V , E ) , $$A \subseteq V$$ A ⊆ V
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi   +8 more
openaire   +4 more sources

First‐Principles Modeling of Solid Solution Softening and Hardening Effects in Al–Mg–Zr–Si Aluminum Alloys

Advanced Engineering Materials, EarlyView.
The role of various alloying elements in face‐centered cubic aluminum on the barrier of a Shockley partial dislocation during its motion is presented. The study aims to understand how alloying atoms such as Mg, Si, and Zr affect the energy landscape for dislocation motion, thus influencing the solid solution hardening and softening in aluminum, which ...
Inna Plyushchay, Zhengqing Wei, Nebahat Bulut, Sibylle Gemming   +3 more
wiley   +1 more source

Improvement of Slack Variable-Free Relaxation Method and its Application to Control Design of T-S Fuzzy Systems

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