Sciweavers

2477 search results - page 4 / 496
» Approximate extended formulations
Sort
View
AMAI
2004
Springer
14 years 25 days ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
MOC
2000
109views more  MOC 2000»
13 years 7 months ago
A mixed formulation of Boussinesq equations: Analysis of nonsingular solutions
Abstract. This paper is concerned with the mixed formulation of the Boussinesq equations in two-dimensional domains and its numerical approximation. The paper deals first with exis...
M. Farhloul, S. Nicaise, L. Paquet
MP
2008
99views more  MP 2008»
13 years 7 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
TIT
2008
81views more  TIT 2008»
13 years 7 months ago
Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
Abstract--In this paper, the Lagrangian formulation of variablerate vector quantization is extended to quantization with simultaneous constraints on entropy and codebook size, incl...
Robert M. Gray, Tamás Linder, John T. Gill ...