Results 211 to 220 of about 1,116 (265)

Influence of Scan Strategies in Electron Beam Powder Bed Fusion on Solidification, Microstructure, and High‐Temperature Compressive Properties of γ′‐Strengthened Inconel 738LC

Advanced Engineering Materials, EarlyView.
Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati, Karthik Kumar Banku, Prasanth Bondi, Ivan Zhirnov, Yangyiwei Yang, Gordon Schmidt, Jürgen Christen, Georg Hasemann, Manja Krüger, Bai‐Xiang Xu, Bilal Gökce, Silja‐Katharina Rittinghaus   +11 more
wiley   +1 more source

Efficient hybrid numerical modeling of the seismic wavefield in the presence of solid-fluid boundaries. [PDF]

Nat Commun
Lyu C, Romanowicz B, Zhao L, Masson Y.
europepmc   +1 more source

Inferring three-nucleon couplings from multi-messenger neutron-star observations. [PDF]

Nat Commun
Somasundaram R, Svensson I, De S, Deneris AE, Dietz Y, Landry P, Schwenk A, Tews I.   +7 more
europepmc   +1 more source

A novel obfuscation method based on majority logic for preventing unauthorized access to binary deep neural networks. [PDF]

Sci Rep
Mohseni A, Moaiyeri MH, Adel MJ.
europepmc   +1 more source

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators

, 2020
Janhunen Tomi, Tasharrofi Shahab
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A SAT-based solver for Q-ALL SAT

Proceedings of the 44th annual Southeast regional conference, 2006
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand to solve even more complex problems residing at the second or higher levels of the polynomial hierarchy.
Ben Browning, Anja Remshagen
openaire   +1 more source

An Extensible SAT-solver

2004
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff. We aim to give sufficient details about implementation to enable the reader to construct his or her own solver in a very short time.This will allow users of SAT-solvers to make domain specific extensions or ...
Niklas Eén, Niklas Sörensson
openaire   +1 more source

FPGA-Based SAT Solver

2006 Canadian Conference on Electrical and Computer Engineering, 2006
The Boolean satisfiability problem (SAT) is a central problem in artificial intelligence, mathematical logic and computing theory with wide range of practical applications. Being an NP-complete problem, the used SAT's solving algorithm execution time influences the performance of SAT-based applications.
Mona Safar, M. Watheq El-Kharashi, Ashraf Salem   +2 more
openaire   +1 more source

Integrating Algebraic and SAT Solvers

2017
For solving systems of Boolean polynomials whose zeros are known to be contained in \(\mathbb {F}_2^n\), algebraic solvers such as the Boolean Border Basis Algorithm (BBBA) and SAT solvers use very different and possibly complementary methods to create new information.
Jan Horácek, Jan Burchard, Bernd Becker 0001, Martin Kreuzer   +3 more
openaire   +2 more sources