Results 1 to 10 of about 7,662,913 (346)
Quantum-Walk-Inspired Dynamic Adiabatic Local Search [PDF]
Entropy, 2023 We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework.
Chen-Fu Chiang, Paul M. Alsing
doaj +2 more sources
Improved Sparrow Search Algorithm Based on Iterative Local Search. [PDF]
Comput Intell Neurosci, 2021 This paper solves the shortcomings of sparrow search algorithm in poor utilization to the current individual and lack of effective search, improves its search performance, achieves good results on 23 basic benchmark functions and CEC 2017, and ...
Yan S, Yang P, Zhu D, Zheng W, Wu F.
europepmc +2 more sources
Improved Local Search with Momentum for Bayesian Networks Structure Learning [PDF]
Entropy, 2021 Bayesian Networks structure learning (BNSL) is a troublesome problem that aims to search for an optimal structure. An exact search tends to sacrifice a significant amount of time and memory to promote accuracy, while the local search can tackle complex ...
Xiaohan Liu +3 more
doaj +2 more sources
BLENDER: Enabling Local Search with a Hybrid Differential Privacy Model [PDF]
The Journal of Privacy and Confidentiality, 2019 We propose a hybrid model of differential privacy that considers a combination of regular and opt-in users who desire the differential privacy guarantees of the local privacy model and the trusted curator model, respectively.
Brendan Avent +4 more
doaj +2 more sources
A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem [PDF]
Sensors, 2020 It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them.
Monique Simplicio Viana +2 more
doaj +2 more sources
International Conference on Learning Representations, 2023 Generative Flow Networks (GFlowNets) are amortized sampling methods that learn a distribution over discrete objects proportional to their rewards.
Minsu Kim +6 more
semanticscholar +3 more sources
SSRN Electronic Journal, 2001 Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on ...
H. R. Lourenço +2 more
semanticscholar +5 more sources
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT [PDF]
Entropy, 2022 The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability with a wide range of real-world applications. In this paper, we propose an initialization and a
Zaijun Zhang +4 more
doaj +2 more sources
Multi-directional local search.
Comput Oper Res, 2012 This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems such as the multi-objective multi-dimensional knapsack problem, the bi-objective set packing problem and the bi ...
Tricoire F.
europepmc +5 more sources
Local Search for Weighted Tree Augmentation and Steiner Tree [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2021 We present a technique that allows for improving on some relative greedy procedures by well-chosen (non-oblivious) local search algorithms. Relative greedy procedures are a particular type of greedy algorithm that start with a simple, though weak ...
Vera Traub, R. Zenklusen
semanticscholar +1 more source