Results 71 to 80 of about 2,708 (158)
, 2018 Heuristics are strategies using readily accessible, loosely applicable information to control problem solving. Algorithms, for example, are a type of heuristic.
Pardalos, Panos +3 more
core +1 more source
PARALLEL GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
, 2004 A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuristic for producing good-quality solutions of combinatorial optimization problems. It is usually implemented with a construction procedure based on a greedy randomized algorithm followed ...
Celso C. Ribeiro, Mauricio G. C. Resende
core
Adaptive heuristics for binary search trees and constant linkage cost
, 1998 We present lower and upper bounds on adaptive heuristics for maintaining binary search trees using a constant number of link or pointer changes for each operation (constant linkage cost (CLC)). We show that no adaptive heuristic with an amortized linkage
Lai, TW, Wood, D.
core
Adaptive heuristics for binary search trees and constant linkage cost
, 1995 We present lower and upper bounds on adaptive heuristics for main-taining binary search trees using a constant number of link or pointer changes for each operation (constant linkage cost (CLC)).
Wood, Derick, Lai, Tony W.
core
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation
, 2012 The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1+1) EA on the class of linear functions.
openaire +4 more sources
Generating counter-examples through randomized guided search
, 2007 . Computational resources are increasing rapidly with the ex-plosion of multi-core processors readily available from major vendors. Model checking needs to harness these resources to help make it more effective in practical verification.
Neha Rungta, Eric G Mercer
core
Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNs. [PDF]
Sensors (Basel)Kol M +3 more
europepmc +1 more source
Adaptive search heuristics for the generalized assignment problem
, 2002 The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the ...
Ramalhinho Lourenço, Helena +1 more
core +1 more source
Learning to explore tree neighbourhoods for phylogenetic inference. [PDF]
Brief BioinformCamerota Verdù FJ +3 more
europepmc +1 more source