Results 111 to 120 of about 128,668 (237)
Parameterized Complexity Results for Plan Reuse
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
The Parameterized Complexity of Happy Colorings [PDF]
Consider a graph $G = (V,E)$ and a coloring $c$ of vertices with colors from $[\ell]$. A vertex $v$ is said to be happy with respect to $c$ if $c(v) = c(u)$ for all neighbors $u$ of $v$. Further, an edge $(u,v)$ is happy if $c(u) = c(v)$. Given a partial coloring $c$ of $V$, the Maximum Happy Vertex (Edge) problem asks for a total coloring of $V ...
I. Vinod Reddy, Neeldhara Misra
openaire +3 more sources
Tunable Mass Transport and Enhanced Electrochemical Performance of CO2 Laser Engraved Electrodes
This work introduces vector‐mode CO2 laser engraving as a rapid strategy to fabricate electrochemical sensors with tunable mass transport. Spiral electrodes can behave as disk electrodes, outperforming conventional raster‐engraved devices in current density and sensitivity.
Davi M. De Farias +2 more
wiley +1 more source
Parameterized Edge Hamiltonicity
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al.
AA Bertossi +27 more
core +1 more source
Influence of Outcoupling Layers on Top‐Emitting Perovskite Light‐Emitting Diodes
Top‐emitting perovskite LEDs offer benefits over typical bottom‐emitting architectures, toward lasing, improved thermal management, and on‐chip fabrication compatibility. Outcoupling layers offer a strategy uniquely applicable to top‐emitting LEDs to optimize EQE by improving optical outcoupling.
James C. Loy +5 more
wiley +1 more source
Parameterized Complexity of Untangling Knots
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
Robots can learn manipulation tasks from human demonstrations. This work proposes a versatile method to identify the physical interactions that occur in a demonstration, such as sequences of different contacts and interactions with mechanical constraints.
Alex Harm Gert‐Jan Overbeek +3 more
wiley +1 more source
A Systematic Approach to Analyze T Cell Migration: Application to Mouse Melanoma Tumors
The results show that a minimum of two migration speeds can be rigorously identified from the data with cells switching between a fast, persistent migratory state, and a slow, random migration state. These results will help in identifying genetic factors that influence rapid migration, among other applications, such as quality control for CAR‐T cell ...
Nikolaos Memmos +4 more
wiley +1 more source
On-board Multi-User Detection Algorithm Based on Conditional Neural Process
With the characteristics of all-terrain, all-weather and seamless coverage, satellite communications have become a potentially important part of 6G.An important prerequisite for achieving satellite intelligence is that the satellite have on-board ...
Yilun LIU +3 more
doaj +2 more sources
On the parameterized complexity of the median and closest problems under some permutation metrics
Genome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics, providing data for phylogenetic reconstruction based on genome ...
Luís Cunha, Ignasi Sau, Uéverton Souza
doaj +1 more source

