Results 101 to 110 of about 6,800,360 (294)

Entropy‐Driven Design of Low‐Melting‐Point Alloys via Compositionally Complex Strategy

open access: yesAdvanced Engineering Materials, EarlyView.
Conventional low‐melting‐point alloys (LMPAs) are limited by a narrow compositional space and inherent property trade‐offs. This review presents an entropy‐driven design strategy that overcomes these limitations, ushering in a new class of low‐melting‐point compositionally complex alloys (LMCCAs).
Yinghui Shang   +6 more
wiley   +1 more source

Permutation Picture of Graph Combinatorial Optimization Problems [PDF]

open access: yes
This paper proposes a framework that formulates a wide range of graph combinatorial optimization problems using permutation-based representations. These problems include the travelling salesman problem, maximum independent set, maximum cut, and various ...
Min, Yimeng
core   +1 more source

Investigating the Low‐Temperature Phase Stability of the Binary Ta–W System

open access: yesAdvanced Engineering Materials, EarlyView.
Atomistic simulations show that the binary Ta–W system forms ordered intermetallic phases, B2‐TaW and D03‐TaW3, as 0 K ground states. Configurational entropy, however, lowers the free energy of the disordered bcc solid solution, which becomes the stable phase above about 400 K.
Klemens Lechner   +7 more
wiley   +1 more source

A Modified Multi-Level Hyper Heuristic for Tackling Combinatorial Optimization Problems [PDF]

open access: yesIJCI International Journal of Computers and Information
Hyper-heuristics are search techniques that operate on heuristic spaces by selecting low-level heuristics appropriately. Hyper-heuristic aims to generate a generalized and automated approaches to solve various problem domains.
Asmaa Awad   +3 more
doaj   +1 more source

Merging Combinatorial Design and Optimization: the Oberwolfach Problem

open access: yesAustralas. J Comb., 2019
The Oberwolfach Problem $OP(F)$ -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph $K_v$ decomposes into edge-disjoint copies of a $2$-regular graph $F$ of order $v$. In this paper, we provide all the necessary equipment to generate solutions to $OP(F)$ for relatively small orders by ...
Fabio Salassa   +4 more
openaire   +8 more sources

Enhancement of the Through‐Thickness Electrical Conductivity of Carbon‐Fiber‐Reinforced Plastics Using Large Graphite Particles

open access: yesAdvanced Engineering Materials, EarlyView.
To enhance through‐thickness conductivity without sacrificing impregnation, large spherical graphite particles are intentionally employed in a low‐viscosity resin. Unlike finer conductive fillers, these particles remain outside the fiber bundles and accumulate in resin‐rich interlaminar regions during molding.
Keito Hosoe   +6 more
wiley   +1 more source

COMBINATORIAL OPTIMIZATION UNDER UNCERTAINTY AND FORMAL MODELS OF EXPERT ESTIMATION

open access: yesВісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технології, 2019
Previously, the author formalized the concepts of uncertainty, compromise solution, compromise criteria and conditions for a quite general class of combinatorial optimization problems.
Alexander Anatolievich Pavlov
doaj   +1 more source

Elastic–Plastic Modeling and Experimental Characterization of Granular Jamming Actuators

open access: yesAdvanced Engineering Materials, EarlyView.
Granular jamming enables rapid switching between soft and rigid mechanical states. Here, a reduced‐order elastic‐perfectly‐plastic beam framework captures pressure‐dependent loading, unloading, residual deformation, and hysteresis in jammed beams, while matching three‐point bending experiments across materials and geometries. The framework links design
Saheli Patel   +2 more
wiley   +1 more source

The Role of Experimental Noise in a Hybrid Classical-Molecular Computer to Solve Combinatorial Optimization Problems. [PDF]

open access: yesACS Cent Sci, 2023
Krasecki VK   +13 more
europepmc   +1 more source

Combinatorial Optimization Problems Arising from Interactive Congestion Situations

open access: yes, 2011
The purpose of this chapter is to survey the research area of game theory applied to congestion situations, where a group of autonomous agents, interacting in a discrete system that underlies various types of combinatorial optimization problems, try to ...
Gourvès, Laurent, Moretti, Stefano
core  

Home - About - Disclaimer - Privacy