Results 121 to 130 of about 34,025 (156)

Random heuristic search: applications to GAs and functions of unitation

Computer Methods in Applied Mechanics and Engineering, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vose, Michael D., Rowe, Jonathan E.
openaire   +1 more source

Logarithmic Convergence of Random Heuristic Search

Evolutionary Computation, 1996
This paper speaks to the inherent emergent behavior of genetic search. For completeness and generality, a class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is then proved. Since the simple genetic algorithm (GA) is an instance of random heuristic search, a corollary is a result ...
openaire   +1 more source

Potency-Based Heuristic Search with Randomness for Explicit Model Checking

2023
Efficient state-space exploration has a significant impact on reachability analysis in explicit model checking and existing tools use several variants of search heuristics and random walks in order to overcome the state-space explosion problem. We contribute with a novel approach based on a random search strategy, where actions are assigned dynamically
Emil G. Henriksen, Alan M. Khorsid, Esben Nielsen, Theodor Risager, Jiří Srba, Adam M. Stück, Andreas S. Sørensen   +6 more
openaire   +3 more sources

Random combinatorial structures and randomized search heuristics

2010
Diese Dissertationsschrift beschäftigt sich mit der wahrscheinlichkeitstheoretischen Analyse von zufälligen kombinatorischen Strukturen und der Laufzeitanalyse randomisierter Suchheuristiken. Im Bereich der zufälligen Strukturen untersuchen wir zwei Klassen kombinatorischer Objekte.
openaire   +2 more sources

Stable Resolving - A Randomized Local Search Heuristic for MaxSAT

2020
Many problems from industrial applications and AI can be encoded as Maximum Satisfiability (MaxSAT). Often, it is more desirable to produce practicable results in very short time compared to optimal solutions after an arbitrary long computation time. In this paper, we propose Stable Resolving (SR), a novel randomized local search heuristic for MaxSAT ...
Julian Reisch, Peter Großmann, Natalia Kliewer   +2 more
openaire   +1 more source

Amplification of Search Performance through Randomization of Heuristics

2002
Randomization as a means for improving search performance in combinatorial domains has received increasing interest in recent years. In optimization contexts, it can provide a means for overcoming the deficiencies of available search heuristics and broadening search in productive directions.
Vincent A. Cicirello, Stephen F. Smith
openaire   +1 more source

Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem

Fundamenta Informaticae, 2020
In this work we investigate the performance of greedy randomised search (GRS) techniques to the problem of compiling quantum circuits to emerging quantum hardware. Quantum computing (QC) represents the next big step towards power consumption minimisation and CPU speed boost in the future of computing machines.
Oddi Angelo, Rasconi Riccardo
openaire   +2 more sources

A random search heuristic for a multi-objective production planning

Computers & Industrial Engineering, 2012
Real world production planning is involved in optimizing different objectives while considering a spectrum of parameters, decision variables, and constraints of the corresponding cases. This comes from the fact that production managers desire to utilize from an ideal production plan by considering a number of objectives over a set of technological ...
Mehdi Karimi-Nasab, Ioannis Konstantaras
openaire   +1 more source

Evolutionary Algorithms and Other Randomized Search Heuristics

2012
In our description of evolutionary algorithms we make use of terms that stem from biology, hinting at the roots of evolutionary algorithms. We adhere to these standard notions as long as they do not collide with standard notions in computer science. Evolutionary algorithms are structurally very simple.
openaire   +1 more source

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

2014
Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target state, e.
Per Kristian Lehre, Carsten Witt
openaire   +1 more source