Results 81 to 90 of about 2,555,427 (286)
Novshek’s trick as a polynomial algorithm
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Advanced Robotics Research, EarlyView.Pak Biawak, a necrobot, embodies an unusual fusion of biology and robotics. Designed to repurpose natural structures after death, it challenges conventional boundaries between nature and engineering. Its movements are precise yet unsettling, raising questions about sustainability, ethics, and the untapped potential of biointegrated machines.
Leo Foulds +2 more
wiley +1 more source
Applied Sciences, 2020 In wavelength-tuning interferometry, the surface profile of the optical component is a key evaluation index. However, the systematic errors caused by the coupling error between the higher harmonics and phase shift error are considerable. In this research,
Fuqing Miao, Seokyoung Ahn, Yangjin Kim
doaj +1 more source
Advanced Robotics Research, EarlyView.This work presents a state‐adaptive Koopman linear quadratic regulator framework for real‐time manipulation of a deformable swab tool in robotic environmental sampling. By combining Koopman linearization, tactile sensing, and centroid‐based force regulation, the system maintains stable contact forces and high coverage across flat and inclined surfaces.
Siavash Mahmoudi +2 more
wiley +1 more source
The Capacity Expansion Path Problem in Networks
Journal of Applied Mathematics, 2013 This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj +1 more source
Polynomial interpretations and the complexity of algorithms [PDF]
, 1992 The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system R which computes a number theoretic function implies a polynomial bound on that ...
Adam Cichon, Pierre Lescanne
openaire +2 more sources
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
Advanced Robotics Research, EarlyView.A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source
Advanced Robotics Research, EarlyView.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
Penerapan Algoritma Optimasi Chaos pada Jaringan Ridge Polynomial untuk Prediksi Jumlah Pengangguran
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2013 Abstrak Ridge polynomial neural network (RPNN) awalnya diusulkan oleh Shin dan Ghosh, dibangun dari jumlah peningkatan order pi-sigma neuron (PSN). RPNN mempertahankan pembelajaran cepat, pemetaan yang kuat dari layer tunggal higher order neural network
Rina Pramitasari, Retantyo Wardoyo
doaj +1 more source
On the efficiency of algorithms for polynomial factoring [PDF]
Mathematics of Computation, 1977 Algorithms for factoring polynomials over finite fields are discussed. A construction is shown which reduces the final step of Berlekamp’s algorithm to the problem of finding the roots of a polynomial in a finite field
openaire +2 more sources