1046 search results - page 38 / 210 » Approximation Algorithms for Domination Search |
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
CPM
1998
Springer
14 years 22 days ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
CCCG
2010
13 years 10 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...