ICTAI
2010
IEEE
13 years 9 months ago
2010
IEEE
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
ICA
2010
Springer
13 years 9 months ago
2010
Springer
We introduce the terms strong sub- and super-Gaussianity to refer to the previously introduced class of densities log-concave is x2 and log-convex in x2 respectively. We derive rel...
EC
2006
13 years 11 months ago
2006
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent pop...
BMCBI
2006
13 years 11 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
— The scaling properties of multimodal optimization methods have seldom been studied, and existing studies often concentrated on the idea that all local optima of a multimodal fu...
CEC
2010
IEEE
14 years 19 days ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
UAI
2003
14 years 26 days ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
AAAI
2000
14 years 26 days ago
2000
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
ECAI
2008
Springer
14 years 1 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
AIPS
2008
14 years 1 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...