Results 231 to 240 of about 522,654 (284)

Enhanced Light-Matter Interaction in Porous Silicon Microcavities Structurally Optimized Using Theoretical Simulation and Experimental Validation. [PDF]

Nanomaterials (Basel)
Granizo E, Kriukova IS, Knysh AA, Sokolov PM, Samokhvalov PS, Nabiev IR.   +5 more
europepmc   +1 more source

Intelligent decision-making framework for selecting optimized substitution boxes in modern block cipher design. [PDF]

Sci Rep
Khan M.
europepmc   +1 more source

Approximation Algorithms for Maximization of $k$-Submodular Function Under a Matroid Constraint

Tsinghua Science and Technology
Yuezhu Liu, Yunjing Sun, Min Li
openaire   +1 more source

Hybrid DFT Quality Thermochemistry and Environment Effects at GGA Cost via Local Quantum Embedding. [PDF]

J Chem Theory Comput
Csóka J, Berta D, Nagy PR.
europepmc   +1 more source

Linearization method for MINLP energy optimization problems. [PDF]

Sci Rep
Zhadan A, Martemyanov A, Allahverdyan A, Petrosian O, Gao H.   +4 more
europepmc   +1 more source

An optimized substitution box generator based on cubic pell curves and its application in image encryption. [PDF]

Sci Rep
Khan MAM, Azam NA, Kamarulhaili H.
europepmc   +1 more source

Optimization by decoded quantum interferometry. [PDF]

Nature
Jordan SP, Shutty N, Wootters M, Zalcman A, Schmidhuber A, King R, Isakov SV, Khattar T, Babbush R.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Algorithm for Decomposition of Integers and Smooth Approximation of Functions

Mathematical and computer modelling. Series: Physical and mathematical sciences, 2022
Узагальнено задачу про розклад степенів на розклад цілих додатних чисел за послідовністю степенів різних порядків, виведені умови розкладу, побудовано алгоритм розкладу. Алгоритм заснований на двох процедурах: 1) досягнення мінімуму нев’язки на кожному кроці алгоритму, 2) прискорення швидкості розкладу шляхом розширення локального базису за рахунок ...
Vasyl Abramchuk, Ihor Ihor Abramchuk
openaire   +3 more sources

Best Algorithms for Approximating the Maximum of a Submodular Set Function

Mathematics of Operations Research, 1978
A real-valued function z whose domain is all of the subsets of N = {1, …, n) is said to be submodular if z(S) + z(T) ≥ z(S ∪ T) + z(S ∩ T), ∀S, T ⊆ N, and nondecreasing if z(S) ≤ z(T), ∀S ⊂ T ⊆ N. We consider the problem maxS⊂N {z(S): |S| ≤ K, z submodular and nondecreasing, z(Ø) = 0}.
Nemhauser, G. L., Wolsey, L. A.
openaire   +2 more sources