Sciweavers

90 search results - page 1 / 18
» Maximizing expected utility over a knapsack constraint
Sort
View
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 5 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
NIPS
2007
13 years 6 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...
ICC
2007
IEEE
13 years 11 months ago
Utility Maximization for OFDMA Systems Over Discrete Sets
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
Chan Zhou, Gerhard Wunder, Thomas Michel
ATAL
2003
Springer
13 years 9 months ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini
CVPR
2004
IEEE
14 years 6 months ago
Atlanta World: An Expectation Maximization Framework for Simultaneous Low-Level Edge Grouping and Camera Calibration in Complex
Edges in man-made environments, grouped according to vanishing point directions, provide single-view constraints that have been exploited before as a precursor to both scene under...
Grant Schindler, Frank Dellaert