Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,153
Stochastic local search algorithms for DNA word design
- In DNA Computing: 8th International Workshop on DNA-Based Computers (editors M. Hagiya and A. Ohuchi), Springer LNCS
, 2002
"... Abstract. We present results on the performance of a stochastic local search algorithm for the design of DNA codes, namely sets of equallength words over the nucleotides alphabet {A, C, G, T} that satisfy certain combinatorial constraints. Using empirical analysis of the algorithm, we gain insight o ..."
Abstract
-
Cited by 26 (4 self)
- Add to MetaCart
Abstract. We present results on the performance of a stochastic local search algorithm for the design of DNA codes, namely sets of equallength words over the nucleotides alphabet {A, C, G, T} that satisfy certain combinatorial constraints. Using empirical analysis of the algorithm, we gain insight
ONE CLASS OF STOCHASTIC LOCAL SEARCH ALGORITHMS
"... [1] Sergienko I.V., Kaspshitskaya M.F. Models and methods solving combinatorial optimization problems on computers. Kyiv, ..."
Abstract
- Add to MetaCart
[1] Sergienko I.V., Kaspshitskaya M.F. Models and methods solving combinatorial optimization problems on computers. Kyiv,
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
-
, 2008
"... The genomic median problem is an optimization problem inspired by a biological issue: it aims to find the chromosome organization of the common ancestor to multiple living species. It is formulated as the search for a genome that minimizes a rearrangement distance measure among given genomes. Seve ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
. Several attempts have been reported for solving this NP-hard problem. These range from simple heuristic methods to a stochastic local search algorithm inspired by WalkSAT, a well-known local search algorithm for the satisfiability problem in propositional logic. The main objective of this research
Stochastic local search algorithms for the graph set T-colouring . . .
- APPROXIMATION ALGORITHMS AND METAHEURISTICS; COMPUTER AND INFORMATION SCIENCE SERIES
, 2005
"... The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that constraints on the separation of any two numbers assigned to a single vertex or to adjacent vertices are satisfied and some ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
of the GSTCP. We compare the performance of previously known as well as new algorithms covering both simple construction heuristics and elaborated stochastic local search algorithms. We investigate systematically different models and search strategies in the algorithms and determine the best choices
On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
, 1999
"... Stochastic local search (SLS) algorithms for the propositional satisfiability problem (SAT) have been successfully applied to solve suitably encoded search problems from various domains. One drawback of these algorithms is that they are usually incomplete. We refine the notion of incompleteness ..."
Abstract
-
Cited by 89 (20 self)
- Add to MetaCart
Stochastic local search (SLS) algorithms for the propositional satisfiability problem (SAT) have been successfully applied to solve suitably encoded search problems from various domains. One drawback of these algorithms is that they are usually incomplete. We refine the notion of incompleteness
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- ARTIFICIAL INTELLIGENCE
, 1999
"... Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behaviour of these algorithms is characterised by a random variable. The detailed knowledge of the run-time distribution provi ..."
Abstract
-
Cited by 55 (16 self)
- Add to MetaCart
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behaviour of these algorithms is characterised by a random variable. The detailed knowledge of the run-time distribution
Stochastic local search algorithms for learning belief networks: Searching
- in the space of orderings, Lecture Notes in Artificial Intelligence 2143
, 2001
"... A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
methods used in this context are greedy hill climbing, either deterministic or stochastic. One of these methods that has been applied with some success is hill climbing with random restart. In this article we study a new algorithm of this type to restart a local search when it is trapped at a local
Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms
"... Exact mathematical programming techniques such as branch-andbound or dynamic programming and stochastic local search techniques have traditionally been seen as being two general but distinct approaches for the effective solution of combinatorial optimization problems, each having particular advanta ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Exact mathematical programming techniques such as branch-andbound or dynamic programming and stochastic local search techniques have traditionally been seen as being two general but distinct approaches for the effective solution of combinatorial optimization problems, each having particular
Path-relinking intensification methods for stochastic local search algorithms
- Journal of Heuristics
, 2012
"... Abstract. Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations wit ..."
Abstract
-
Cited by 13 (6 self)
- Add to MetaCart
with more elaborate metaheuristic schemes such as genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions.
Results 1 - 10
of
10,153
