1603 search results - page 30 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
CP
1998
Springer
15 years 2 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
OR
2010
Springer
14 years 4 months ago
2010
Springer
Abstract With potential application to a variety of industries, fleet sizing problems present a prevalent and significant challenge for engineers and managers. This is especially t...
CAS
2008
14 years 10 months ago
2008
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...