47 search results - page 2 / 10 » Linear time approximation schemes for the Gale-Berlekamp gam... |
WADS
2005
Springer
13 years 10 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
IJCAI
2003
13 years 6 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
FCT
2003
Springer
13 years 10 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
AAAI
2012
11 years 7 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...