Results 111 to 120 of about 94,026 (313)
Lead Halide Perovskite Photoelectrocatalysis
Lead halide perovskite semiconductors have emerged as highly promising materials for solar fuel and chemical synthesis. This perspective discusses advances made in the rational photoelectrode design to improve solar‐to‐chemical conversion, product scope, and scalability.
Virgil Andrei
wiley +1 more source
Efficient phase unwrapping [PDF]
In the field of optical interferometry, two-dimensional projections of light interference patterns are often analysed in order to obtain measurements of interest.
AI-Sawaf, Firas
core
This review summarizes the principles and challenges of nonaqueous lithium‐oxygen batteries and recent advances in cathode catalysts, including carbon‐based materials, metals, oxides, sulfides, nitrides, carbides, and redox mediators. It highlights emerging design strategies and artificial intelligence‐driven approaches, emphasizing data‐assisted ...
Yuqing Yao +8 more
wiley +1 more source
Realizing efficient outcomes in cost spanning problems [PDF]
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. The only subgame equilibrium payoff is efficient. Moreover, we extend the result to the case of budget restrictions.
Gustavo Bergantiños, Juan Vidal-Puga
core
Outlier detection using iterative adaptive mini-minimum spanning tree generation with applications on medical data. [PDF]
Li J +5 more
europepmc +1 more source
We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano +5 more
wiley +1 more source
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core
Minimum cost arborescences [PDF]
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core
Extensions of the minimum labelling spanning tree problem
In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source
A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem. [PDF]
Zhang S, Mao J, Wang N, Li D, Ju C.
europepmc +1 more source

