Results 41 to 50 of about 19,980 (297)
A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization [PDF]
Fixed-basis and variable-basis approximation schemes are compared for the problems of function approximation and functional optimization (also known as infinite programming).
Gnecco, Giorgio +3 more
core +1 more source
An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has ...
Bi-Ying Wang +5 more
doaj +1 more source
A polymerizable deep eutectic solvent is reinforced with tannic acid‐modified cellulose nanofibers to construct a hierarchical dynamic eutectogel network. Synergistic covalent and reversible interactions impart ultrahigh stretchability, high ionic conductivity, broad temperature tolerance, self‐healing, and strong adhesion, enabling robust wearable ...
Huang Wu +11 more
wiley +1 more source
Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies [PDF]
This paper proposes the use of multiagent cooperation for solving global optimization problems through the introduction of a new multiagent environment, MANGO.
Günay, Akın +6 more
core +1 more source
Multi-objective optimization is the process of simultaneously optimizing two or more conflicting objectives subject to certain constraints. Real-life engineering designs often contain more than one conflicting objective function, which requires a multi ...
R. Venkata Rao, G.G. Waghmare
doaj +1 more source
This work presents a ligand‐pairing strategy that reconstructs lead sulfide quantum dot surfaces for efficient short‐wave infrared optoelectronics. A low‐reactivity thiourea precursor combined with hydrobromic acid enables monodisperse and fully passivated quantum dots.
Dongeon Kim +16 more
wiley +1 more source
A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm
In recent years, 3-term conjugate gradient algorithms (TT-CG) have sparked interest for large scale unconstrained optimization algorithms due to appealing practical factors, such as simple computation, low memory requirement, better sufficient descent ...
Ghada Moayid Al-Naemi, Samaa AbdulQader
doaj +1 more source
An Efficient Algorithm for Unconstrained Optimization [PDF]
This paper presents an original and efficient PSO algorithm, which is divided into three phases: (1) stabilization, (2) breadth-first search, and (3) depth-first search. The proposed algorithm, called PSO-3P, was tested with 47 benchmark continuous unconstrained optimization problems, on a total of 82 instances.
de-los-Cobos-Silva, Sergio Gerardo +5 more
openaire +2 more sources
ABSTRACT The accelerating expansion of data‐centric technologies is sharply increasing the energy burden of information storage, placing unprecedented pressure on the efficiency of magnetic switching. Conventional field‐driven reversal, once the foundation of magnetic memory, has become impractical in modern architectures due to its high energy cost ...
Mohammad H. Badarneh +2 more
wiley +1 more source
Hydration‐induced symmetry breaking transforms layered LiInP2S6${\rm LiInP}_2{\rm S}_6$ from a nonpolar to a chiral‐polar phase, producing a giant enhancement of non‐resonant second‐harmonic generation. The reversible tuning of polar order through molecular intercalation establishes a strategy for dynamically controlling nonlinear optical ...
Jadupati Nag +8 more
wiley +1 more source

