Results 81 to 90 of about 42,360 (298)

Fixed-Parameter Tractability of Maximum Colored Path and Beyond

open access: yesACM Transactions on Algorithms, 2023
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as follows. We give a randomized algorithm, that given a colored \(n\)
Fedor V. Fomin   +4 more
openaire   +3 more sources

Numerical Modeling of Photothermal Self‐Excited Composite Oscillators

open access: yesAdvanced Robotics Research, EarlyView.
We present a numerical framework for simulating photothermal self‐excited oscillations. The driving mechanism is elucidated by highlighting the roles of inertia and overshoot, as well as the phase lag between the thermal moment and the oscillation angle, which together construct the feedback loop between the system state and the environmental stimulus.
Zixiao Liu   +6 more
wiley   +1 more source

Scheduling Meets Fixed-Parameter Tractability

open access: yes, 2013
Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems.
Mnich, Matthias, Wiese, Andreas
openaire   +2 more sources

Robotic Control for Human–Robot Collaborative Assembly Based on Digital Human Model and Reinforcement Learning

open access: yesAdvanced Robotics Research, EarlyView.
This work presents a robotic control method for human–robot collaborative assembly based on a biomechanics‐constrained digital human model. Reinforcement learning is used to generate physiologically plausible human motion trajectories, which are integrated into a virtual environment for robot control learning.
Bitao Yao   +4 more
wiley   +1 more source

Almost 2-SAT is fixed-parameter tractable

open access: yesJournal of Computer and System Sciences, 2009
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most $k$ clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to different research communities in Theoretical Computer Science under the names 'Almost 2-SAT', 'All-but-$k$ 2-SAT', '2-CNF deletion', '2-SAT deletion'.
Razgon, I, O'Sullivan, B
openaire   +4 more sources

Design and Modeling of a High‐Displacement, Skin‐Integrated Flexible Electromagnetic Actuator for Haptic Interfaces in Virtual Reality

open access: yesAdvanced Robotics Research, EarlyView.
A flexible, skin‐integrated electromagnetic actuator is developed for wearable virtual/augmented reality (VR/AR) haptic systems. A tunable design model enables control over displacement and resonance frequency. The system is validated through a custom VR application with a 6 × 4 actuator array, demonstrating real‐time, spatially targeted tactile ...
Naji Tarabay   +9 more
wiley   +1 more source

Finding Points in General Position

open access: yes, 2017
We study computational aspects of the General Position Subset Selection problem defined as follows: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-
Froese, Vincent   +3 more
core   +1 more source

Engineered Living Systems With Self‐Organizing Neural Networks: From Anatomy to Behavior and Gene Expression

open access: yesAdvanced Science, EarlyView.
Ectodermal tissue excised from Xenopus embryos self‐organizes into a three‐dimensional mucociliary organoid. Here, we generate a neural variant, termed neurobot, by implanting neural precursor cells. Neurobots develop mature neurons, adopt distinct morphologies, exhibit more complex motility, and respond differentially to neuroactive compounds. Imaging
Haleh Fotowat   +6 more
wiley   +1 more source

Risk-Aware Adaptive Safety Margins for Model Predictive Control with Orientation–Motion Coupled Barrier Functions in Dynamic Environments

open access: yesActuators
Safe navigation in dynamic environments remains challenging because classical distance-based constraints ignore the coupling between a robot’s translational motion and attitude dynamics, and fixed safety margins are either over-conservative or risky ...
Nuo Xu   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy