Results 61 to 70 of about 248,790 (377)

Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials

open access: yesAdvanced 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

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

open access: yesJournal 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

Preparation and Thermal Modification of Disentangled Ultrahigh‐Molecular‐Weight Polyethylene Particles for Powder‐Based Additive Manufacturing

open access: yesAdvanced Engineering Materials, EarlyView.
Ultrahigh‐molecular‐weight polyethylene powders (<≈40 μm) with a bulk density of 260 g L−1 are prepared from a silica supported bisimine pyridine iron catalyst. The nascent product is disentangled and can be thermally densified without loss of its low viscosity.
Adrian Vaghar   +4 more
wiley   +1 more source

Spanning trees without adjacent vertices of degree 2

open access: yes, 2019
Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2.
Lyngsie, Kasper Szabo, Merker, Martin
core   +1 more source

The Emerging 4D Printing of Shape‐Memory Thermomorphs for Self‐Adaptative Biomedical Implants

open access: yesAdvanced Functional Materials, EarlyView.
4D printing enables the creation of smart implants that adapt to changing conditions in the human body over time. At the core of this technology are shape‐memory thermomorphs (SMTMs). This review offers an in‐depth analysis of 4D printing with SMTMs, emphasizing the latest advancements in smart materials, stimuli, programming principles, and their ...
Aixiang Ding, Fang Tang, Eben Alsberg
wiley   +1 more source

Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method

open access: yesJournal 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

Computing Minimum Spanning Trees with Uncertainty

open access: yes, 2008
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge $e$ of the graph only a set $A_e$, called an uncertainty area, that contains the actual edge weight $w_e$ is known. The algorithm can `update' $e$ to obtain the edge weight $w_e in A_e$.
Erlebach, Thomas   +4 more
openaire   +7 more sources

Interfacial Contact Engineering Enables Giant‐Performance Semiconductor Nanomembrane Optoelectronic Devices

open access: yesAdvanced Functional Materials, EarlyView.
This work investigates modifying interfacial contacts in realizing giant‐performance semiconductor nanomembrane optoelectronics. Strategies, including surface reaction and buffer layer work‐function modulation, are explored to boost the Schottky barrier. An emerging material of YbOx is utilized for near‐ideal Ohmic contact.
Yibo Zhang   +5 more
wiley   +1 more source

Generalized minimum spanning tree games

open access: yesEURO Journal on Computational Optimization, 2016
The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost
PhuocHoang Le   +2 more
doaj  

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]

open access: yes, 2009
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Avis   +28 more
core   +1 more source

Home - About - Disclaimer - Privacy