Results 111 to 120 of about 1,645,700 (287)
Location-Aware Influence Blocking Maximization in Social Networks
IEEE Access, 2018 In real social networks, it is often the case that opposite opinions, ideas, products, or innovations are propagating simultaneously. Although the competitive influence problem has been extensively studied, existing works neglect the fact that the ...
Wenlong Zhu +5 more
doaj +1 more source
Origami‐Inspired Morphing Fuselage for Agile Fixed‐Wing Flight
Advanced Robotics Research, EarlyView.Conventional aircraft steer with rigid control surfaces. SoAR instead replaces the fuselage itself with a cable‐driven origami continuum body that bends in 3D and compresses on demand. Whole‐fuselage morphing steers fixed‐wing flight: achieving sharp, near‐zero‐radius turns and rapid braking without ailerons, rudder, or elevator, while the same ...
Abudula Aihaitijiang, Cagdas D. Onal
wiley +1 more source
Fast greedy algorithms in mapreduce and streaming
, 2013 Greedy algorithms are practitioners ’ best friends—they are intu-itive, simple to implement, and often lead to very good solutions. However, implementing greedy algorithms in a distributed setting is challenging since the greedy choice is inherently ...
Sergei Vassilvitskii +3 more
core +1 more source
Magnetically Actuated Microrobot for Drug Delivery: Current Progress and Challenges
Advanced Robotics Research, EarlyView.Magnetically actuated microrobots are reshaping targeted drug delivery through wireless propulsion, programmable materials, and localized therapeutic release. This review examines how fabrication, body material selection, structural architecture, loading mechanisms, and imaging‐guided control converge to enable microrobotic therapies while identifying ...
Yang Yang, David J. Cappelleri
wiley +1 more source
Maximizing Nash Social Welfare Based on Greedy Algorithm and Estimation of Distribution Algorithm
BiomimeticsThe Nash social welfare (NSW) problem is relevant not only to the economic domain but also extends its applicability to the field of computer science. However, maximizing Nash social welfare is an APX-hard problem.
Weizhi Liao +4 more
doaj +1 more source
Advanced Robotics Research, EarlyView.A balanced multimodal food‐waste dataset and a novel Split Spatial‐Spectral Attention fusion framework are presented for robotic contaminant detection. Separate processing of RGB, thermal, and multispectral inputs preserves subtle material signatures before feature integration, reducing modality interference and improving classification and ...
Matthew Vestal +5 more
wiley +1 more source
Advanced Robotics Research, EarlyView.This review brings together 20 publications describing 11 robotic system families developed for instrument handling, sterile‐package opening, supply delivery, and operating room logistics. Perception is becoming more capable through deep learning and language‐guided control, but autonomy remains limited, evidence is largely laboratory‐based, and no ...
Eugenia Mawuenya Akpo +4 more
wiley +1 more source
Rainbow Greedy Matching Algorithms
, 2023 We consider the problem of finding a large rainbow matching in a random graph with randomly colored edges. In particular we analyze the performance of two greedy algorithms for this problem. The algorithms we study are colored versions of algorithms that
Bennett, Patrick +2 more
core
Distributed Micropneumatic Sensors for Soft Robots to Detect Touch and Pose
Advanced Robotics Research, EarlyView.Soft robots need integrated touch and pose sensing for safe and reliable operation. This work presents a three‐fingered soft gripper with 18 micropneumatic sensors made from the same materials as its pneumatic actuators. By measuring airflow resistance changes in deforming microchannels of the sensors, finger pose and contact are detected, enabling ...
Vilma Lampinen +3 more
wiley +1 more source
Super Greedy Type Algorithms and Applications In Compressed Sensing
, 2011 In this manuscript we study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms super greedy type algorithms.
Liu, Entao
core +1 more source