220 search results - page 44 / 44 » Using genetic programming to obtain implicit diversity |
CP
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
RECOMB
2002
Springer
14 years 6 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
EVOW
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. This work presents scale invariant region detectors that apply evolved operators to extract an interest measure. We evaluate operators using their repeatability rate, and...
EAAI
2006
13 years 5 months ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...