Results 51 to 60 of about 25,776 (266)
CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz +4 more
wiley +1 more source
An Ellipsoidal Branch and Bound Algorithm for Global Optimization
19 ...
William W. Hager, Dzung T. Phan
openaire +3 more sources
The physical realization of artificial neurons is a critical challenge for energy‐efficient neuromorphic computing. This review presents a comprehensive analysis of the evolution of artificial neuron implementations from conventional CMOS to emerging post‐CMOS technologies.
Kannan Udaya Mohanan +4 more
wiley +1 more source
The analysis of optical eigenmodes in chiral liquid crystal with perpendicular or tilted helical axis, and their correspondence with the external medium, leads to an intuitive understanding of the angle and wavelength dependency of transmissive and reflective diffraction.
Ke Xu +5 more
wiley +1 more source
DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM [PDF]
The use of methods of branches and boundaries as well as the methods of dynamic programming at solving the problem of «knapsack» is grounded. The main concepts are expounded.
S. Kantsedal, M. Kostikova, I. Skrypina
doaj
A branch & bound algorithm for the open-shop problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Brucker +3 more
openaire +3 more sources
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
Branch-and-bound algorithm to minimize the total completion time on two dedicated processors
In this paper, we propose an exact method for solving the problem of scheduling multiprocessor tasks on two dedicated processors with release dates. In this problem, we have three subsets of tasks, where these tasks need one or two dedicated processors ...
Adel Kacem, Abdelaziz Dammak
doaj +1 more source
ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
The behavior of the number of partial problems T(A) which are decomposed in a branch and-bound algorithm A (T(A) may be taken as a measure for the computational efficiency of A) is investigated in a fairly general setting. The first result is that the mean number f(n) of T(A) when A is applied to problems of size n grows at least as fast as ...
openaire +2 more sources
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm [PDF]
Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new strategy to compute very accurate approximations of feasible points.
Alexandre Goldsztejn +3 more
openaire +4 more sources

