Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 38 for “"Hill climbing"”.
-
Generalized hill climbing algorithms for discrete optimization problems
Generalized hill climbing (GHC) algorithms are introduced, as a tool to address difficult discrete optimization problems. Particular formulations of GHC algorithms include simulated annealing (SA), local search, and threshold accepting (T A), among. others. A proof of convergence of GHC algorithms …
-
A Convergence Analysis of Generalized Hill Climbing Algorithms
Generalized hill climbing (GHC) algorithms provide a unifying framework for describing several discrete optimization problem local search heuristics, including simulated annealing and tabu search. A necessary and a sufficient convergence condition for GHC algorithms are presented. The convergence …
-
Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems
Generalized hill climbing (GHC) algorithms provide a framework for using local search algorithms to address intractable discrete optimization problems. Many well-known local search algorithms can be formulated as GHC algorithms, including simulated annealing, threshold accepting, Monte Carlo …
-
Classificação não supervisionada no contexto de tamanho e forma
… de hipóteses, algoritmo K-médias e o algoritmo hill climbing. Também propomos as combinações dos algoritmos, com os métodos de ensemble: bagging e boosting. Para os dados simulados, gerados a partir da distribuição normal complexa, propomos três possíveis cenários para avaliar o desempenho dos …
-
Reinforcement Learning of Distributed Surveillance Plans
… is compared with the uniform policy and hill climbing algorithms by executing them on a common set of different data files, generated programmatically with various combinations of problem size, location, and orientation transitions as well as rewards of attacker and defender. The …
-
Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants
… simulated annealing algorithm, a stochastic hill climbing procedure, and a top performing approximation algorithm, 3-WOLF, are compared against each other and the standard benchmark barycenter heuristic on weighted and unweighted bipartite graphs. Both unweighted and weighted versions of …
-
Learning Compositional Abstract Models Incrementally for Efficient Bilevel Task and Motion Planning
… objective. We use this surrogate objective in a hill-climbing search over predicate sets drawn from a grammar, which we call predicate invention. However, our research highlights another limitation in current symbolic operator learning techniques. They often fall short in robotics scenarios where …
-
Testing the effect of varying environments on the speed of evolution
… results. With some string lengths using hill climbing, switching goals sped up evolution. With other string lengths using hill climbing, and using the other evolutionary algorithms, either evolution with a fixed goal was faster or results were inconclusive.
-
Testing the effect of varying environments on the speed of evolution
… results. With some string lengths using hill climbing, switching goals sped up evolution. With other string lengths using hill climbing, and using the other evolutionary algorithms, either evolution with a fixed goal was faster or results were inconclusive.
-
Analyses of algorithm performance for an oversubscribed scheduling problem
… problems. The algorithms in the set are: hill-climbing, a genetic algorithm (GA) and Squeaky Wheel Optimization (SWO). All the algorithms in the set are designed to traverse the same search space: solutions are represented as permutations of tasks; a greedy schedule builder converts the …
-
Tvarkaraščio sudarymo bibliotekų tyrimas /
… search, Simulated Annealing, Late Acceptance Hill Climbing and simple Hill Climbing. The results of this research can be used to help choose the best algorithm for solving a planning problem based on the restriction groups used to define it. Experiments have shown a correlation between …
-
Optimizing Aviation Security Architectures using the SAFE Model
… alarm for each individual device. A Generalized Hill Climbing (GHC) algorithm was implemented to identify the system with the minimum operational cost. Suggestions for future research directions are also included.
-
Informed selection and use of training examples for knowledge refinement.
… heuristic search. Refinement tools typically use hill-climbing search to identify suitable repairs but run the risk of getting caught in local optima. A novel contribution of this thesis is solving the local optima problem by converting the hill-climbing search into a best-first search that can …
-
Sustainability of the Service-Profit Chain
… The above is accomplished by incorporating a hill-climbing algorithm into the dynamic SPC model. This hill-climbing algorithm senses the current state of the system and compares it to a certain goal to determine the discrepancies and make additional interventions. The objective is to determine …
-
Limitations and Extensions of the WoLF-PHC Algorithm
Policy Hill Climbing (PHC) is a reinforcement learning algorithm that extends Q-learning to learn probabilistic policies for multi-agent games. WoLF-PHC extends PHC with the "win or learn fast" principle. A proof that PHC will diverge in self-play when playing Shapley's game is given, and WoLF-PHC …
-
Parameter search in an agent-based model of pedestrian movement in retail environments
… components: (1) the implementation of a hill-climbing training module and (2) a pedestrian path comparison metric. To measure the module's performance, the system is tested against video sequences collected from the actual retail environment.
-
A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles
… AD-Lib combines greedy search techniques with hill climbing and effective backtracking to guide the search process rapidly towards the goal. Using simulations of a four-thruster hovercraft, AD-Lib is compared to existing suboptimal search algorithms in both known and unknown environments with …
-
Design and control of photovoltaic systems in distributed generation
… method. The proposed algorithm improves the hill climbing search method by fuzzifying the rules, thereby eliminating some of the disadvantages associated with the method. Modification of the proposed maximum power point tracker is proposed to increase photovoltaic system performance during …
-
Finding Hadamard and (epsilon,delta)-Quasi-Hadamard Matrices with Optimization Techniques
… optimization algorithms (Exhaustive search, Hill Climbing, Metropolis, Gradient methods, generalizations thereof, etc.), improve their performance (when using a Graphical Processing Unit), and use them to attempt to find Hadamard matrices (real, and complex). Finally, we give an algorithm to …
-
Pagenumber problem.
… be NP-complete, we describe two solutions using Hill Climbing methods and one solution using Genetic Algorithms for one and two-dimensional models. Two two-dimensional models are considered namely the square and rook models. We have given a unified framework for all three pagenumber models, in …
Page 1 of 2