Results 181 to 190 of about 8,140,957 (328)
Load Distributing Metamaterials Via Discrete Optimization
Mechanical metamaterials are computationally optimized to homogenize transmitted forces by minimizing the spread of reaction forces. The resulting architectures transform localized loading into broader, more uniform force distributions and experimentally demonstrate robust load spreading under quasi‐static and impact loading.
Andrea Detry +6 more
wiley +1 more source
Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization. [PDF]
Kawase E, Kikuchi S, Tamai H, Tanaka S.
europepmc +1 more source
A gas‐fed, zero‐gap, PEM CO2 electrolyzer is realized by incorporating PDDA+ ions onto the carbonaceous Co/N‐C electrocatalyst, with gaseous H2 and CO2 fed into the anode and cathode, respectively. Operating without an aqueous electrolyte, the system sustains a peak FECO of 65.1% at 100 mA cm−2. ABSTRACT Electrochemical carbon dioxide reduction (ECO2R)
Yuen Leong Chow +6 more
wiley +1 more source
Physics‐Grounded Materials Artificial Intelligence for Reliable Materials Discovery
Physics‐Grounded Materials AI (PhysMat AI) integrates physical priors, descriptors, constraints, verification, and data infrastructure into a unified full‐stack framework, enabling reliable, interpretable, and autonomous AI‐driven materials discovery.
Yuhang Wang +3 more
wiley +1 more source
Precision meets speed through an FPGA-based natively sparse Ising machine for combinatorial optimization. [PDF]
Yao B +6 more
europepmc +1 more source
Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +1 more source
Adaptive approach heuristics for the generalized assignment problem [PDF]
The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the
Helena Ramalhinho-Lourenço +1 more
core
Retraction: Application of enhanced benders decomposition algorithm in circular assembly line balancing problem with task splitting. [PDF]
PLOS One Editors.
europepmc +1 more source
Autonomous scanning probe microscopy and multi‐objective Bayesian optimization navigate a ternary (Al,Sc,B)N combinatorial library. Registered photoluminescence, electron‐probe compositional mapping, and X‐ray diffraction connect local electromechanical function to defect‐sensitive emission, composition, and crystal structure.
Yu Liu +12 more
wiley +1 more source
The Quantum Optimization Benchmarking Library. [PDF]
Koch T +26 more
europepmc +1 more source

