Results 1  10
of
388,589
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2182 (27 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
When Will a Genetic Algorithm Outperform Hill Climbing?
 Advances in Neural Information Processing Systems 6
, 1993
"... We analyze a simple hillclimbing algorithm (RMHC) that was previously shown to outperform a genetic algorithm (GA) on a simple "Royal Road" function. We then analyze an "idealized" genetic algorithm (IGA) that is significantly faster than RMHC and that gives a lower bound for GA ..."
Abstract

Cited by 175 (2 self)
 Add to MetaCart
We analyze a simple hillclimbing algorithm (RMHC) that was previously shown to outperform a genetic algorithm (GA) on a simple "Royal Road" function. We then analyze an "idealized" genetic algorithm (IGA) that is significantly faster than RMHC and that gives a lower bound
A late acceptance strategy in hillclimbing for examination timetabling problems
 In Proceedings of the conference on the Practice and Theory of Automated Timetabling(PATAT
, 2008
"... Over the years, many variants, extensions and adaptations of local search techniques have appeared in the literature. Some of them have become extremely famous, such as Simulated Annealing. Other ones have almost been forgotten, for example, “RecordtoRecord Travelling ” (Dueck 1993) or the “Old Ba ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
HillClimbing algorithm. Although its performance is known to be relatively worse than that of more sophisticated metaheuristics, it is still very popular thanks to its simplicity. It is also widely used in different hybridizations, such as guided, multistart or variable neighborhood search methods
Probabilistic HillClimbing
 Proceedings of Computational Learning Theory and 'Natural' Learning Systems
, 1991
"... Many learning tasks involve searching through a discrete space of performance elements, seeking an element whose future utility is expected to be high. As the task of finding the global optimum is often intractable, many practical learning systems use simple forms of hillclimbing to find a locally ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Many learning tasks involve searching through a discrete space of performance elements, seeking an element whose future utility is expected to be high. As the task of finding the global optimum is often intractable, many practical learning systems use simple forms of hillclimbing to find a locally
Climbing Up NPHard Hills
 In Parallel Problem Solving from Nature IV
, 1996
"... . Evolutionary algorithms are sophisticated hillclimbers. In this paper, we discuss the ability of this class of local search algorithms to provide useful and efficient heuristics to solve NPhard problems. Our discussion is illustrated on experiments aiming at solving the jobshopscheduling pr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
obtained by simple hillclimbing algorithms. We also show that our results compare favorably with other published results. 1 Introduction Our work aims at assessing what EAs are good for in the context of combinatorial optimization with regards to other search methods (both exact and non exact). We
Width Beam and HillClimbing . . .
, 2014
"... In this paper we propose to enhance a widthbeam search in order to solve the threedimensional sphere packing problem. The goal of the problem is to determine the minimum length of the container having fixed width and height, that packs n predefined unequal spheres. The widthbeam search uses a g ..."
Abstract
 Add to MetaCart
greedy selection phase which determines a subset of eligible positions for packing the predefined items in the target object and selects a subset of nodes for exploring some promising paths. We propose to handle lower bounds in the tree and apply a hillclimbing strategy in order to diversify
When Will a Genetic Algorithm Outperform Hill Climbing?
 Advances in Neural Information Processing Systems 6
, 1993
"... We analyze a simple hillclimbing algorithm (RMHC) that was previously shown to outperform a genetic algorithm (GA) on a simple "Royal Road" function. We then analyze an "idealized" genetic algorithm (IGA) that is significantly faster than RMHC and that gives a lower bound fo ..."
Abstract
 Add to MetaCart
We analyze a simple hillclimbing algorithm (RMHC) that was previously shown to outperform a genetic algorithm (GA) on a simple "Royal Road" function. We then analyze an "idealized" genetic algorithm (IGA) that is significantly faster than RMHC and that gives a lower bound
Better HillClimbing Searches for Parsimony
 IN: WABI
, 2003
"... The reconstruction of evolutionary trees is a major problem in biology, and many evolutionary trees are estimated using heuristics for the NPhard optimization problem Maximum Parsimony. The current heuristics for searching through tree space use a particular technique, called “treebisection and re ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
algorithm for computing the best 2ECR neighbors of a given tree, based upon a simple data structure which also allows us to efficiently calculate the best neighbors under NNI, SPR, and TBR operations (as well as efficiently running the greedy sequence addition technique for maximum parsimony). More
The Late Acceptance HillClimbing Heuristic
, 2012
"... This paper introduces a new and very simple search methodology called Late Acceptance HillClimbing (LAHC). It is a onepoint iterative search algorithm, which accepts nonimproving moves when a candidate cost function is better (or equal) than it was a number of iterations before. This value appear ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper introduces a new and very simple search methodology called Late Acceptance HillClimbing (LAHC). It is a onepoint iterative search algorithm, which accepts nonimproving moves when a candidate cost function is better (or equal) than it was a number of iterations before. This value
HillClimbing Finds Random Planted Bisections
 Proc. 12th Symposium on Discrete Algorithms (SODA 01), ACM press, 2001
, 2001
"... We analyze the behavior of hillclimbing algorithms for the minimum bisection problem on instances drawn from the "planted bisection" random graph model, Gn;p;q , previously studied in [3, 4, 10, 12, 15, 9, 7]. This is one of the few problem distributions for which various popular heuristi ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We analyze the behavior of hillclimbing algorithms for the minimum bisection problem on instances drawn from the "planted bisection" random graph model, Gn;p;q , previously studied in [3, 4, 10, 12, 15, 9, 7]. This is one of the few problem distributions for which various popular
Results 1  10
of
388,589