Results 51 to 60 of about 258,484 (338)
Machine Learning Applied to High Entropy Alloys under Irradiation
Advanced Engineering Materials, EarlyView.Designing alloys for extreme environments demands fast, trustworthy prediction. This review charts how machine learning—especially machine‐learned interatomic potentials and predictive models based on experiment‐informed datasets—captures the complexity of high‐entropy alloys in extreme environments, predicts phase formation, mechanical properties, and
Amin Esfandiarpour +8 more
wiley +1 more source
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source
Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials
Advanced Engineering Materials, EarlyView.This article explores how machine learning (ML) revolutionizes the study and design of disordered materials by uncovering hidden patterns, predicting properties, and optimizing multiscale structures. It highlights key advancements, including generative models, graph neural networks, and hybrid ML‐physics methods, addressing challenges like data ...
Hamidreza Yazdani Sarvestani +4 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.Commercial light‐based 3D printers increasingly find use for industry‐scale production of microstructured tissue culture devices. How can commercial printer performance be assessed for a given application? This work introduces simplified quantitative metrics based on microstructural fidelity analysis, addressing key manufacturing challenges in scaling ...
Zoltán András Guller +4 more
wiley +1 more source
Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method
Journal of Intelligent Systems, 2014 Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets (SVNSs) are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and ...
Ye Jun
doaj +1 more source
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +2 more sources
Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication [PDF]
, 2019 Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost.
King, Valerie, Mashreghi, Ali
core +1 more source
Magnetoactive Metamaterials: A State‐of‐the‐Art Review
Advanced Engineering Materials, EarlyView.Magnetoactive metamaterials combine magnetoactive composites with architected metastructures to enable contactless, tunable control of mechanical, acoustic, and elastic properties. This review highlights recent advances in their design, fabrication, and applications in soft robotics, biomedical devices, and adaptive structures and outlines future ...
Seyyedmohammad Aghamiri, Ramin Sedaghati
wiley +1 more source
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game [PDF]
, 2014 Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \emph{red} edges and a set $B$ of \emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \emph{Stackelberg Minimum Spanning Tree}
Bilò, Davide +3 more
core +2 more sources