241 search results - page 24 / 49 » Constraint Handling in Genetic Algorithms: The Set Partition... |
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
To recognize three-dimensional objects it is important to
model how their appearances can change due to changes
in viewpoint. A key aspect of this involves understanding
which o...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
PRL
2008
13 years 7 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
DATE
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
EOR
2008
13 years 7 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...