Results 81 to 90 of about 5,218 (313)

Characterization of Aluminized Layers on Inconel‐738 Alloy: Microstructure, Modeling of Aluminizing Kinetics, and Thermal Behavior

open access: yesAdvanced Engineering Materials, EarlyView.
This study explored how effective nickel aluminide coatings are obtained in providing oxidation resistance applied to the Inconel 738 alloy, modeling with diffusion models. In the present study, kinetics and thermal behavior of the Inconel 738 alloy were studied by the low‐temperature thermoreactive aluminizing process, which was carried out at 625°C ...
Gozde Celebi Efe   +4 more
wiley   +1 more source

Combinatorial Games

open access: yes
This paper examines two classical combinatorial games, Nim and the Domino Game on Linear Strips, through the shared principles of parity, recursion, and binary structure. It begins by formalizing Nim, where each position’s outcome is determined by the Nim-sum (bitwise XOR) of heap sizes: positions with zero Nim-sum are losing, and optimal play involves
Elliot Mendelson, Daniel Zwillinger
openaire   +3 more sources

Microstructural Evolution and Vacancy Defect Formation in Mn–Mo–Ni RPV Steel Under Low Cycle Fatigue: Insights From EBSD and PALS

open access: yesAdvanced Engineering Materials, EarlyView.
Low‐cycle fatigue damage in Mn–Mo–Ni reactor pressure vessel steel is examined using a combined electron backscatter diffraction and positron annihilation lifetime spectroscopy approach. The study correlates texture evolution, dislocation substructure development, and vacancy‐type defect formation across uniform, necked, and fracture regions, providing
Apu Sarkar   +2 more
wiley   +1 more source

Interactive Ant Colony Optimization to Support Adaptation in Serious Games

open access: yesInternational Journal of Serious Games, 2019
The success of serious games usually depends on their capabilities to engage learners and to provide them with personalized gaming and learning experiences.
Michael Kickmeier-Rust   +1 more
doaj   +1 more source

Combinatorial optimization in nash games

open access: yesComputers & Mathematics with Applications, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Combinatorial games modeling seki in GO

open access: yesDiscrete Mathematics, 2014
This paper describes results and conjectures on two closely related games, SEKI and D-SEKI, played on matrices of non-negative integers. These games were inspired of so-called seki positions in the game Go. This paper should be viewed as an investigation into the structure of SEKI and D-SEKI, without particular practical applications to Go.
Andrey Gol'berg   +4 more
openaire   +1 more source

Thermodynamic Pathways of Nonequilibrium Solidification in Wire‐Arc Additive Manufacturing Fe‐Based Multicomponent Alloy Structures

open access: yesAdvanced Engineering Materials, EarlyView.
Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios   +5 more
wiley   +1 more source

Pyramidal Structures on Yttria‐Stabilized Zirconia after High Temperature Exposure at 1500°C: New Features on an Old Material

open access: yesAdvanced Engineering Materials, EarlyView.
New features on yttria‐stabilized zirconia after exposure at 1500°C: Newly discovered pyramidal structures on an old material. After exposure at 1550°C on the cross section of YSZ new features, namely pyramidal structures are discovered. These structures grow with time, increase in numbers, appear as singularities, are often arranged in strings, and ...
Doris Sebold   +2 more
wiley   +1 more source

From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory

open access: yesEntropy, 2018
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou   +1 more
doaj   +1 more source

PSPACE-hardness of some combinatorial games

open access: yesJournal of Combinatorial Theory, Series A, 1987
PSPACE-hardness of four families of win-lose-draw games played on a digraph with blocking, capture, or annihilation rules is proved. Special cases of three of the families are shown to be PSPACE-complete. Further, the PSPACE-completeness of six families of win-lose games in which two players mark or remove nodes of digraphs according to given rules is ...
Aviezri S. Fraenkel   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy