Sciweavers

35 search results - page 1 / 7
» Stochastic Enforced Hill-Climbing
Sort
View
AIPS
2008
13 years 7 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
EVOW
2001
Springer
13 years 9 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
13 years 8 months ago
Robot gaits evolved by combining genetic algorithms and binary hill climbing
In this paper an evolutionary algorithm is used for evolving gaits in a walking biped robot controller. The focus is fast learning in a real-time environment. An incremental appro...
Lena Mariann Garder, Mats Erling Høvin
ICML
1994
IEEE
13 years 8 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
IAT
2006
IEEE
13 years 10 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler