Results 71 to 80 of about 178,189 (288)
MathematicsIn this paper, we investigate a single machine scheduling problem with a proportional job deterioration. Under release times (dates) of jobs, the objective is to minimize the total weighted completion time.
Zheng-Guo Lv +3 more
doaj +1 more source
Maximum Inner-Product Search using Tree Data-structures [PDF]
, 2012 The problem of {\em efficiently} finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied in literature.
Gray, Alexander G., Ram, Parikshit
core
Advanced Materials, EarlyView.Magnetic tunnel junctions (MTJs) using MgO tunnel barriers face challenges of high resistance‐area product and low tunnel magnetoresistance (TMR). To discover alternative materials, Literature Enhanced Ab initio Discovery (LEAD) is developed. The LEAD‐predicted materials are theoretically evaluated, showing that MTJs with dusting of ScN or TiN on ...
Sabiq Islam +6 more
wiley +1 more source
Advanced Materials, EarlyView.A machine learning‐guided bio‐interfacial design strategy resolves the long‐standing strength–toughness–functionality trade‐off in nanocomposites. By efficiently mapping high‐performance regions in the composition–processing space, the approach delivers hierarchically entangled, nanosheet‐pinned architectures that combine mechanical robustness ...
Hao Wang +10 more
wiley +1 more source
An algorithm for solving a class of knapsack problems and its generalization [PDF]
Computer Science Journal of Moldova, 2005 A class of knapsack problems which generalizes the classical ones is studied. Algorithms based on the dynamical programming and Branch and Bound methods are proposed. The correctness and time estimation of the algorithm are given.
Elena Balan
doaj
Arm‐Length‐Controlled CsPbBr3 Nanocrystals for Tunable Optical and Assembly Behavior
Advanced Materials, EarlyView.In this work, the synthesis parameters that dictate the formation of armed CsPbBr3 nanocrystals are described, and routes enabling precise control over arm length are proposed. Direct links between morphology and optoelectronic behavior are established.
Irina Skvortsova +13 more
wiley +1 more source
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
Satisfiability-Based Algorithms for Boolean Optimization
, 2004 This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering.
Manquinho, V., Marques-Silva, J. P.
core +2 more sources
An Ellipsoidal Branch and Bound Algorithm for Global Optimization
SIAM Journal on Optimization, 2009 19 ...
Hager, William, Phan, Dzung
openaire +2 more sources
Powder‐to‐Film Conversion of Nickel Single‐Atom Catalysts into Binder‐Free and Resistant Electrodes
Advanced Materials Interfaces, EarlyView.A reproducible strategy is reported for fabricating standalone thin‐film electrodes composed of CNx‐supported Ni single‐atom catalysts. The resulting binder‐free electrodes exhibit robust stability, enhanced charge transfer, and superior electrochemical performance, offering scalable opportunities for applications in electrochemistry. ABSTRACT Although
Milla Vigliengo +8 more
wiley +1 more source