Sciweavers

715 search results - page 29 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
AUSAI
2003
Springer
15 years 2 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
ECAI
2008
Springer
14 years 11 months ago
Structure Learning of Markov Logic Networks through Iterated Local Search
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...
Marenglen Biba, Stefano Ferilli, Floriana Esposito
CIBCB
2009
IEEE
14 years 10 months ago
rnaDesign: Local search for RNA secondary structure design
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
Denny C. Dai, Herbert H. Tsang, Kay C. Wiese
CIDM
2007
IEEE
15 years 4 months ago
K2GA: Heuristically Guided Evolution of Bayesian Network Structures from Data
— We present K2GA, an algorithm for learning Bayesian network structures from data. K2GA uses a genetic algorithm to perform stochastic search, while employing a modified versio...
Eli Faulkner
CVPR
2007
IEEE
15 years 11 months ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid