1576 search results - page 13 / 316 » Properties of Synthetic Optimization Problems |
119
click to vote
ISAAC
1993
Springer
15 years 3 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
109
click to vote
MOC
2002
14 years 11 months ago
2002
We study the convergence properties of the hp-version of the local discontinuous Galerkin finite element method for convection-diffusion problems; we consider a model problem in a ...
109
click to vote
WWW
2008
ACM
16 years 11 days ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
ICML
2007
IEEE
16 years 15 days ago
2007
IEEE
We provide a framework to exploit dependencies among arms in multi-armed bandit problems, when the dependencies are in the form of a generative model on clusters of arms. We find ...
109
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...