447 search results - page 32 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
133
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
168
click to vote
ICML
2002
IEEE
16 years 6 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
163
click to vote
MP
2006
15 years 5 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
182
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
174
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...