22 search results - page 4 / 5 » Symmetry Breaking and Local Search Spaces |
ANOR
2011
13 years 8 days ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
Fingerprint indexing is an efficient technique that greatly improves the performance of fingerprint based person authentication systems by reducing the number of comparison. In th...
CP
2004
Springer
13 years 9 months ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
CONSTRAINTS
2011
13 years 7 days ago
2011
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...