Results 51 to 60 of about 122,614 (295)
A branch and bound and simulated annealing approach for job shop scheduling [PDF]
, 2004 This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In
Salim, Sutinah, Tan, Hui Woon
core
Advanced Functional Materials, EarlyView.A previously unreported coordination motif stabilising single Fe atoms by indigo chelation and pyridyl coordination on Au(111) has been revealed. By using planar tritopic pyridyl linkers (TPyB), extended 2D porous networks of indigo3(TPyB)2Fe6 form. These networks can be crystalline or vitreous and offer an environment where individual coordination ...
Hongxiang Xu +9 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Here, we present a high‐density PEDOT eutectogel electrode array for enhanced body surface gastric mapping. Silver electrodes are blade‐coated onto flexible substrates, followed by electrogelation of PEDOT:PSS and the deposition of a PEDOT:LS eutectogel.
Christopher Slaughter +8 more
wiley +1 more source
Hybrid Annealing Krill Herd and Quantum-Behaved Particle Swarm Optimization
Mathematics, 2020 The particle swarm optimization algorithm (PSO) is not good at dealing with discrete optimization problems, and for the krill herd algorithm (KH), the ability of local search is relatively poor.
Cheng-Long Wei, Gai-Ge Wang
doaj +1 more source
Parallel Deterministic and Stochastic Global Minimization of Functions with Very Many Minima [PDF]
, 2011 The optimization of three problems with high dimensionality and many local minima are investigated under five different optimization algorithms: DIRECT, simulated annealing, Spall’s SPSA algorithm, the KNITRO package, and QNSTOP, a new algorithm ...
Castle, Brent S. +4 more
core +1 more source
Simulated annealing for generalized Skyrme models
, 2005 We use a simulated annealing algorithm to find the static field configuration with the lowest energy in a given sector of topological charge for generalized SU(2) Skyrme models.
J.-P. Longpré +6 more
core +1 more source
A simulated annealing algorithm for finding consensus sequences [PDF]
Bioinformatics, 2002 Abstract Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules.
Jonathan M. Keith +6 more
openaire +4 more sources
Advanced Functional Materials, EarlyView.This review systematically highlights the latest achievements in mixed‐valence states relevant to hydrogen and oxygen evolution reactions, providing essential insights into future directions and methods for large‐scale practical implementation. This critical review is expected to provide an overview of recent advancements in diverse valence‐state metal
Jitendra N. Tiwari +4 more
wiley +1 more source
Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming
Information, 2018 The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used.
Ai-Hua Zhou +6 more
doaj +1 more source
Generation of Nonlinear Substitutions by Simulated Annealing Algorithm
Information, 2023 The problem of nonlinear substitution generation (S-boxes) is investigated in many related works in symmetric key cryptography. In particular, the strength of symmetric ciphers to linear cryptanalysis is directly related to the nonlinearity of ...
Alexandr Kuznetsov +7 more
doaj +1 more source