2040 search results - page 298 / 408 » Approximate Expectation Maximization |
126
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
102
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
153
click to vote
JCSS
2008
15 years 3 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
129
click to vote
JSYML
2010
15 years 1 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
131
Voted
TON
2010
15 years 1 months ago
2010
—We develop analytical models to characterize pricing of spectrum rights in cellular CDMA networks. Specifically, we consider a primary license holder that aims to lease its spe...