430 search results - page 62 / 86 » Constructing Dynamic Optimization Test Problems Using the Mu... |
125
click to vote
IPCO
2010
14 years 11 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
111
Voted
CVPR
2003
IEEE
15 years 2 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
86
Voted
JCNS
2010
14 years 4 months ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
97
Voted
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, block diagonal linear discriminant analysis (BDLDA) is improved and applied to gene expression data. BDLDA is a classification tool with embedded feature selection...