Results 151 to 160 of about 248,790 (377)

Bioinspired Bare Bones Mayfly Algorithm for Large-Scale Spherical Minimum Spanning Tree. [PDF]

open access: yesFront Bioeng Biotechnol, 2022
Zhang T, Zhou Y, Zhou G, Deng W, Luo Q.
europepmc   +1 more source

Improving Light Outcoupling and Addressing Measurement Specifics in Perovskite Light‐Emitting Diodes with Light Management Foils

open access: yesAdvanced Photonics Research, EarlyView.
The necessity and feasibility of enhancing light outcoupling in perovskite light‐emitting diodes (PeLEDs) is highlighted. On near‐IR PeLEDs, low‐cost, micro‐textured light management (LM) foils demonstrate boost in light extraction. Optimizing perovskite thickness and the optical cavity in synergy with LM foils is crucial for maximizing performance ...
Milan Kovačič   +3 more
wiley   +1 more source

Minimum spanning tree analysis of brain networks: A systematic review of network size effects, sensitivity for neuropsychiatric pathology, and disorder specificity. [PDF]

open access: yesNetw Neurosci, 2022
Blomsma N   +8 more
europepmc   +1 more source

Cost Monotonic "Cost and Charge" Rules for Connection Situations [PDF]

open access: yes
The special class of conservative charge systems for minimum cost spanning tree (mcst) situations is introduced.These conservative charge systems lead to single-valued rules for mcst situations, which can also be described with the aid of obligation ...
Brânzei, R.   +3 more
core   +1 more source

Predicting Fiber Length Characteristics of Recycled Cotton and Cellulose Fiber Blends Using Machine Learning Models

open access: yesAdvanced Theory and Simulations, EarlyView.
This study explores machine learning‐driven prediction of fiber length characteristics in sustainable yarn blends made from recycled cotton and Lyocell. By analyzing empirical data through models like Random Forest and Gradient Boosting, and interpreting results with SHAP, key fiber length features from the Staple Diagram and Fibrogram are identified ...
Tuser Tirtha Biswas   +2 more
wiley   +1 more source

An approximation algorithm for the at least version of the generalized minimum spanning tree problem

open access: yesJournal of Numerical Analysis and Approximation Theory, 2006
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a ...
Petrică C. Pop   +2 more
doaj   +2 more sources

Constant-Time Algorithms for Minimum Spanning Tree and Related Problems on Processor Array with Reconfigurable Bus Systems [PDF]

open access: yes
[[abstract]]A processor array with a reconfigurable bus system is a parallel computation model that consists of a processor array and a reconfigurable bus system.
Pan, Tien-Tai
core   +1 more source

Home - About - Disclaimer - Privacy