3049 search results - page 411 / 610 » On the Convergence of Bound Optimization Algorithms |
160
Voted
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
125
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
140
click to vote
CPAIOR
2006
Springer
15 years 8 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
147
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
131
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...