7930 search results - page 390 / 1586 » Greedy in Approximation Algorithms |
190
click to vote
INFOCOM
1998
IEEE
1998
IEEE
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
15 years 11 months ago
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
179
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
230
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
290
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
139
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...