Results 161 to 170 of about 524,063 (295)
Deviation Algorithms For Ranking Shortest Paths
, 1999 The shortest path problem is a classical network problem that has been extensively studied. The problem of determining not only the shortest path, but also listing the K shortest paths (for a given integer K ? 1) is also a classical one but has not been
Ernesto de Queirós Vieira Martins +2 more
core
Advances in Sustainable and Wearable Textile Based Soft Robotics
Advanced Functional Materials, EarlyView.This Review examines advances in wearable textile‐based soft robotics, focusing on sustainable materials, integrated sensing, and scalable actuation. It discusses manufacturing and system integration across healthcare, assistive robotics, prosthetics, and human–machine interfaces, and highlights key challenges in circular design, including life‐cycle ...
Zahir Abbas +6 more
wiley +1 more source
Structure‐Guided Dynamical Mechanics in Bioinspired Double Twisted Laminated Thin Films
Advanced Functional Materials, EarlyView.This work explores a dynamic mechanistic study of crack propagation and puncture testing via real‐time monitoring of crack initiation, propagation, and termination through nature‐inspired single and double twisted architectures fabricated from cellulose nanocrystals.
Justin Brackenridge +4 more
wiley +1 more source
Protein-fold recognition using an improved single-source K diverse shortest paths algorithm. [PDF]
Proteins, 2016 Lhota J, Xie L.
europepmc +1 more source
Electrospun Wood‐Derived Biopolymers as Electrodes in Electrochemical Energy Storage Technologies
Advanced Functional Materials, EarlyView.Electrospinning transforms wood‐derived cellulose and lignin into architecturally defined, binder‐free carbon electrodes with tuneable porosity and functionality. This review shows how fibre design enables decoupled charge and mass transport, enhancing performance across battery systems, while identifying key challenges in spinnability, scalability ...
Michael W. Thielke +3 more
wiley +1 more source
Shortest Paths In Unweighed Graphs
, 2005 When dealing with shortest paths in weighed or unweighed graphs, one may solve one-to-one, one-to-all or all-to-all instances. But the known algorithms compute one single shortest path of the considered instance.
Koskas, Michel
core
Advanced Functional Materials, EarlyView.Photoaligned and photopatterned liquid crystal platforms provide programmable control of optical phase, polarization, and spin‐orbit interactions, enabling compact generation of structured light and complex wavefronts. This review highlights how tailored molecular orientations transform simple beams into designed optical fields, opening versatile ...
Le Zhou +6 more
wiley +1 more source
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Theory Comput SystBentert M, Fomin FV, Golovach PA.
europepmc +1 more source
Advanced Functional Materials, EarlyView.A novel oil–water selective conformance control agent, MPRP, is prepared via hydrophilic grafting and mechanical granulation. MPRP uniformly disperses in water, cohesively expands upon aging, and readily dissolves in the oil phase. During conformance control, it selectively aggregates in water channeling pathways to form effective plugs without ...
Guang Zhao +6 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Monolithic UV‐ozone oxidation of Ta forms an ultrathin Ta2O5/TaOx bilayer enabling resistive switching with a vertical defect gradient. A stoichiometric surface layer over an oxygen‐deficient sublayer promotes localized filament nucleation near the top interface, enabling low‐voltage operation, and reduced cycle‐to‐cycle variability.
Seunghoon Yang +11 more
wiley +1 more source