1576 search results - page 12 / 316 » Properties of Synthetic Optimization Problems |
PAMI
2007
13 years 9 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
NIPS
2003
13 years 11 months ago
2003
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
OL
2010
13 years 8 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Numerous biological functions--such as enzymatic catalysis, the immune response system, and the DNA-protein regulatory network--rely on the ability of molecules to specifically rec...
EVOW
2005
Springer
14 years 3 months ago
2005
Springer
We focus on the Golomb ruler problem, a hard constrained combinatorial optimization problem. Two alternative encodings are considered, one based on the direct representation of sol...