Results 31 to 40 of about 7,662,913 (346)
Accelerating AutoDock4 with GPUs and Gradient-Based Local Search.
Journal of Chemical Theory and Computation, 2019 AutoDock4 is a widely used program for docking small molecules to macromolecular targets. It describes ligand-receptor interactions using a physics-inspired scoring function that has been proven useful in a variety of drug discovery projects.
Diogo Santos-Martins +5 more
semanticscholar +1 more source
Heuristics for NP-hard optimization problems - simpler is better!?
Logistics & Sustainable Transport, 2015 We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at
Žerovnik Janez
doaj +1 more source
Which Local Search Operator Works Best for the Open-Loop TSP?
Applied Sciences, 2019 The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant.
Lahari Sengupta +2 more
doaj +1 more source
Formulation space search approach for the teacher/class timetabling problem [PDF]
Yugoslav Journal of Operations Research, 2008 We consider the well known NP-hard teacher/class timetabling problem. Variable neighborhood search and tabu search heuristics are developed based on idea of the Formulation Space Search approach.
Kochetov Yuri +2 more
doaj +1 more source
An analysis of Harmony Search for solving Sudoku puzzles
Soft Computing Letters, 2021 The Harmony Search metaheuristic has been used to solve many different optimization problems. Several papers examined its effectiveness for solving Sudoku puzzles.
Rachel H. Chae, Amelia C. Regan
doaj +1 more source
Beyond Local Search: Tracking Objects Everywhere with Instance-Specific Proposals [PDF]
Computer Vision and Pattern Recognition, 2016 Most tracking-by-detection methods employ a local search window around the predicted object location in the current frame assuming the previous location is accurate, the trajectory is smooth, and the computational capacity permits a search radius that ...
Gao Zhu, F. Porikli, Hongdong Li
semanticscholar +1 more source
2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009 In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning (CDCL) scheme to local search. First an extended implica- tion graph for complete assignments of the set of variables is proposed.
Audemard, Gilles +3 more
openaire +2 more sources
Local Search Yields a PTAS for k-Means in Doubling Metrics [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly k-MEANS: given a set of data points and a parameter k, select k centres and partition the data points into k clusters around these centres ...
Zachary Friggstad +2 more
semanticscholar +1 more source
, 2022 AbstractImprovement methods constitute the backbone of most metaheuristics. These methods repeatedly perform slight, local modifications on a current solution to the problem. Hence, for any solution, a set of neighbor solutions must be defined. Clearly, the definition of this set depends on the problem modeling. However, a natural neighborhood may turn
openaire +1 more source
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
Algorithms, 2015 The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu +5 more
doaj +1 more source