Results 71 to 80 of about 53,582 (275)

Indecomposable combinatorial games

open access: yesJournal of Combinatorial Theory, Series A
In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If there are no such summands, then the form is indecomposable.
Michael Fisher   +4 more
openaire   +3 more sources

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

Two games on arithmetic functions: SALIQUANT and NONTOTIENT [PDF]

open access: yesDiscrete Mathematics Letters, 2023
Paul Ellis   +3 more
doaj   +1 more source

Effect of Laser Deoxidation on Adhesive‐Bonded Aluminum in an Oxygen‐Free Atmosphere

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser ablation of aluminum under oxygen‐free conditions. The goal is to produce oxide‐free substrates that enable improved adhesive bonding with epoxy. Optimized laser parameters (90% overlap, 300 µJ) combined with oxide‐free substrates result in the highest tensile strength of the adhesive bond.
Sandra Gerland   +5 more
wiley   +1 more source

On a combinatorial game

open access: yesJournal of Combinatorial Theory, Series A, 1973
Es wird das folgende verallgemeinerte Mühlespiel betrachtet: Gegeben seien die Mengen \(A_k\) und es sei \(S= \bigcup ^m_{k=1}A_k\). Die beiden Spieler wählen abwechselnd je ein Element aus \(S\). Wer als erster alle Elemente einer der Mengen \(A_k\) zusammen hat, hat gewonnen. Sei \(|A_k| =n\) und sei \(m^*(n)\) die kleinste Zahl \(m\) (= Anzahl der \(
Erdös, P, Selfridge, J.L
openaire   +2 more sources

Removing Oxide Layers and Retaining Oxide‐Free Steel Surfaces by Polishing in Oxygen‐Free Atmosphere

open access: yesAdvanced Engineering Materials, EarlyView.
In this study, the efficacy of wet mechanical polishing under an oxygen‐free atmosphere for deoxidation and the retention of an oxide‐free steel surface are elucidated using X‐ray photoelectron spectroscopy. The methodology proved successful; however, the results were highly dependent on the preparation of the solvents used to clean the samples after ...
Friedrich Bürger   +2 more
wiley   +1 more source

Absolute combinatorial game theory

open access: yes
43 pages, 2 ...
Larsson, Urban   +2 more
openaire   +2 more sources

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

MDTS: automatic complex materials design using Monte Carlo tree search

open access: yesScience and Technology of Advanced Materials, 2017
Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search).
Thaer M. Dieb   +5 more
doaj   +1 more source

Simple Combinatorial Optimisation Cost Games [PDF]

open access: yes
In this paper we introduce the class of simple combinatorial optimisation cost games, which are games associated to {0, 1}-matrices.A coalitional value of a combinatorial optimisation game is determined by solving an integer program associated with this ...
Velzen, S. van
core   +1 more source

Home - About - Disclaimer - Privacy