Results 21 to 30 of about 21,263 (317)

Probabilistic recurrence relations revisited

open access: yesTheoretical Computer Science, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chaudhuri, S., Dubhashi, D.
openaire   +5 more sources

n-Color partitions with weighted differences equal to minus two

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1997
In this paper we study those n-color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to −2 Results obtained in this paper for these partitions include several combinatorial identities, recurrence ...
A. K. Agarwal, R. Balasubrananian
doaj   +1 more source

Extending the Applicability of a Two-Step Chord-Type Method for Non-Differentiable Operators

open access: yesMathematics, 2019
The semi-local convergence analysis of a well defined and efficient two-step Chord-type method in Banach spaces is presented in this study. The recurrence relation technique is used under some weak assumptions.
Ioannis K. Argyros   +2 more
doaj   +1 more source

Cloaking and Antennas: From Theoretical Paradigms to Next‐Generation Intelligent Systems

open access: yesAdvanced Optical Materials, EarlyView.
The inception of electromagnetic cloaking sparked an immediate question: Can antennas be made invisible? Two decades later, this review charts the intertwined progress of major cloaking strategies (from transformation optics to scattering cancellation), metasurface technology, and their application to antennas, revealing how AI‐enabled devices are ...
Helen Guo, Xun Li
wiley   +1 more source

Hard‐Magnetic Soft Millirobots in Underactuated Systems

open access: yesAdvanced Robotics Research, EarlyView.
This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang   +4 more
wiley   +1 more source

Aging as a Loss of Goal‐Directedness: An Evolutionary Simulation and Analysis Unifying Regeneration with Anatomical Rejuvenation

open access: yesAdvanced Science, EarlyView.
The paper proposes that the root cause of aging is the loss of anatomical goal‐directedness after development. Using evolutionary neural cellular automata simulations, the authors show that after the organism has reached its developmental homeostatic setpoint (the adult morphology), the absence of target state to pursue leads to a drifting anatomical ...
Léo Pio‐Lopez   +2 more
wiley   +1 more source

Recurrence Relations for Jacobi Orthogonal Polynomials on the Triangular Domain

open access: yesImage Analysis and Stereology
In this paper, we present recurrence relations for the Jacobi weighted orthogonal polynomials Pn,r(α,β,γ) (u, v, w) with r = 0, 1, . . . , n, where n ≥ 0, defined on the triangular domain T = {(u, v, w) : u, v, w ≥ 0, u + v + w = 1} for values of α, β ...
Wala’a A. AlKasasbeh   +5 more
doaj   +1 more source

Exact Formula for Computing the Hyper-Wiener Index on Rows of Unit Cells of the Face-Centred Cubic Lattice

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018
Similarly to Wiener index, hyper-Wiener index of a connected graph is a widely applied topological index measuring the compactness of the structure described by the given graph. Hyper-Wiener index is the sum of the distances plus the squares of distances
Mujahed Hamzeh, Nagy Benedek
doaj   +1 more source

Recurrence relations based on minimization

open access: yesJournal of Mathematical Analysis and Applications, 1974
AbstractThis paper investigates solutions of the general recurrence M(0) = g(0), M(n + 1) = g(n + 1) + min0⩽k⩽n(αM(k) + βM(n − k)) for various choices of α, β, and g(n). In a large number of cases it is possible to prove that M(n) is a convex function whose values can be computed much more efficiently than would be suggested by the defining recurrence.
Michael L. Fredman, Donald E. Knuth
openaire   +3 more sources

Learning to Navigate in Chemical Fields Without A Map at Low Reynolds Numbers

open access: yesAdvanced Science, EarlyView.
Deep reinforcement learning enables a reconfigurable artificial microswimmer to exhibit run‐and‐tumble strategy to navigate toward a chemical source. This mapless microswimmer can robustly navigate in diverse chemical fields without relying on a pre‐existing map.
Yangzhe Liu   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy