716 search results - page 120 / 144 » Semilinear Program Feasibility |
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
JSS
2002
14 years 9 months ago
2002
Most software development errors are caused by incorrect or ambiguous requirement specifications gathered during the requirement elicitation and analysis phase. For the past decad...
ICML
2002
IEEE
15 years 10 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 ...
103
Voted
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...