Sciweavers

2393 search results - page 333 / 479
» Bounds-Consistent Local Search
Sort
View
EVOW
2010
Springer
14 years 2 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
14 years 2 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 1 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
14 years 1 months ago
Inference of genetic networks using S-system: information criteria for model selection
In this paper we present an evolutionary approach for inferring the structure and dynamics in gene circuits from observed expression kinetics. For representing the regulatory inte...
Nasimul Noman, Hitoshi Iba
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
14 years 1 months ago
Combining genetic algorithms with squeaky-wheel optimization
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...
Justin Terada, Hoa Vo, David Joslin