Sciweavers

4488 search results - page 508 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Introducing MONEDA: scalable multiobjective optimization with a neural estimation of distribution algorithm
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
Luis Martí, Jesús García, Ant...
DAC
2006
ACM
16 years 7 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
ECML
2007
Springer
16 years 27 days ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
16 years 7 days ago
Directional self-learning of genetic algorithm
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
Lin Cong, Yuheng Sha, Licheng Jiao, Fang Liu
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 11 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates