Results 101 to 110 of about 1,864,097 (296)

Miniaturized Magnetic Tip Design for Endoluminal Vine Robot Navigation

open access: yesAdvanced Robotics Research, EarlyView.
A magnetic tip mount is designed for a miniaturized 7 mm soft‐growing vine robot to enable wireless magnetic steering and onboard imaging, while preserving a 3 mm working channel. The internal–external ring magnets design balances magnetic attachment with low eversion pressure. Experiments demonstrate ±90° steering, 34 mm bending radius, and successful
Andrea Yanez Trujillo   +4 more
wiley   +1 more source

Parameterized Algorithms for (r,l)-Partization

open access: yesJournal of Graph Algorithms and Applications, 2013
We consider the (r,l)-Partization problem of finding a set of at most k vertices whose deletion results in a graph that can be partitioned into r independent sets and l cliques.
R. Krithika, N. Narayanaswamy
doaj   +1 more source

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)

open access: yes, 2017
Dagstuhl Seminar 17041 "Randomization in Parameterized Complexity" took place from January 22nd to January 27th 2017 with the objective to bridge the gap between randomization and parameterized complexity theory.
Hermelin, Danny   +3 more
core   +1 more source

Mutual Adaptation and Influence: Review of Latent Dynamics Models in Human–Robot Interaction

open access: yesAdvanced Robotics Research, EarlyView.
Robots are becoming better teammates by learning hidden patterns in how people act. This review covers how state‐of‐the‐art approaches leverage these patterns to help robots not only react but also anticipate and guide cooperation. Here, we synthesize a unifying framework for these approaches, classify and review existing works, and highlight key ...
Mason O. Smith   +4 more
wiley   +1 more source

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges

open access: yesJournal of Graph Algorithms and Applications
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge of the input
Carla Binucci   +4 more
doaj   +1 more source

DRIVE‐SAFE: Data‐Driven Robustness and Informed Validation for Evolving Specifications via Formal Evaluation

open access: yesAdvanced Robotics Research, EarlyView.
DRIVE‐SAFE evaluates learning‐based, black‐box autonomous driving policies against evolving temporal safety requirements using Signal Temporal Logic robustness metrics. It aggregates distributional robustness measures with domain‐informed weights to guide iterative retraining.
Kristy Sakano   +3 more
wiley   +1 more source

Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue

open access: yesAlgorithms, 2016
We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj   +1 more source

A Parameterized Complexity View on Collapsing k-Cores [PDF]

open access: yes, 2019
We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining graph, that is, the (uniquely determined) largest induced subgraph with ...
Suchý, Ondrej   +2 more
core   +1 more source

Technical Feasibility Study of Autonomous Field Robot‐Based on‐the‐go Assessment of Soil Nutrients Using Ion‐Sensitive Field‐Effect Transistors

open access: yesAdvanced Robotics Research, EarlyView.
Autonomous field robots equipped with ISFET‐based sensors enable rapid, spatially resolved soil nutrient analysis directly in the field. An automated system based on the BoniRob platform is presented for standardized on‐site extraction and measurement of key macronutrients and soil pH.
Vadim Riedel   +3 more
wiley   +1 more source

On the parameterized complexity of approximate counting [PDF]

open access: yes, 2011
In this paper we study the parameterized complexity of approximating the parameterized counting problems contained in the class $\#W[P]$, the parameterized analogue of $\#P$.
J. Andrés Montoya, Andrés Montoya, J.
core   +1 more source

Home - About - Disclaimer - Privacy