Results 91 to 100 of about 1,864,097 (296)
Parameterized Complexity of Untangling Knots
Abstract. 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.
Clément Legrand-Duchesne +2 more
openaire +6 more sources
Automated poultry processing lines still rely on humans to lift slippery, easily bruised carcasses onto a shackle conveyor. Deformability, anatomical variance, and hygiene rules make conventional suction and scripted motions unreliable. We present ChicGrasp, an end‐to‐end hardware‐software co‐designed imitation learning framework, to offer a ...
Amirreza Davar +8 more
wiley +1 more source
Complexity and Approximability of Parameterized CSP
The complexity of various Constraint Satisfaction Problems (CSP) when parameterized by structural measures (such as treewidth or clique-width) is a well-investigated area.
Mitsou, Valia
core +1 more source
On the parameterized complexity of diverse SAT
27 pages, 5 figures; this is full version of the corresponding paper accepted and presented at the 35th International Symposium on Algorithms and Computation (ISAAC 2024)
Neeldhara Misra +2 more
openaire +5 more sources
This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
Since Beineke's work in 1968 on linegraphs, attention has focused on the classification of graphs as linegraphs. It is known that every graph $G$ is the linegraph of an hypergraph, and the question is to characterize that root graph.
Dominique Barth +2 more
doaj +1 more source
Parameter Ecology for Feedback Vertex Set
This paper deals with the Feedback Vertex Set problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles.
Bart M. P. Jansen +2 more
doaj +1 more source
LLM‐Integrated Human–Robot Interaction System for Microrobots
This paper proposes an LLM‐based control framework for guiding microrobots using human natural language. This framework can convert the natural human speech into safe and executable command sets for reliable navigation in complex environments. The experimental results show high accuracy and robustness in task performance, demonstrating the potential of
Bairong Zhu, Amar Salehi, Tingting Yu
wiley +1 more source
On the Parameterized Complexity of Contraction to Generalization of Trees [PDF]
For a family of graphs F, the F-Contraction problem takes as an input a graph G and an integer k, and the goal is to decide if there exists S \subseteq E(G) of size at most k such that G/S belongs to F.
Agrawal, Akanksha +5 more
core +1 more source
On the Parameterized Complexity of Odd Coloring
Appeared in CALDAM ...
Sriram Bhyravarapu +2 more
openaire +4 more sources

