CORR
2011
Springer
12 years 8 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
EC
2010
13 years 4 months ago
2010
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
SAGA
2001
Springer
13 years 9 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
AUSAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, the multiple trajectory search (MTS) is presented for large scale global optimization. The MTS uses multiple agents to search the solution space concurrently. Eac...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...