14 search results - page 3 / 3 » The Exact Feasibility of Randomized Solutions of Uncertain C... |
131
Voted
APPROX
2010
Springer
15 years 3 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...
141
click to vote
KSEM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
116
Voted
STOC
2004
ACM
16 years 2 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...
109
click to vote
SIAMJO
2010
14 years 8 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...