212 search results - page 28 / 43 » Optimal sampling of genetic algorithms on polynomial regress... |
AAAI
1998
13 years 10 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
IAJIT
2008
13 years 8 months ago
2008
: In this paper, we present an approach for writer identification carried out using off-line Arabic handwriting. Our proposed method is based on the combination of global and struc...
TEC
2002
13 years 8 months ago
2002
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
JMLR
2012
11 years 11 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...