6192 search results - page 1020 / 1239 » Structure benefits all |
222
click to vote
APPROX
2010
Springer
15 years 8 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...
209
click to vote
AAAI
2010
15 years 8 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
202
click to vote
AAAI
2010
15 years 8 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
186
click to vote
DIMVA
2010
15 years 8 months ago
2010
Abstract. In order to obtain and maintain control, kernel malware usually makes persistent control flow modifications (i.e., installing hooks). To avoid detection, malware develope...
235
click to vote
AIPS
2004
15 years 8 months ago
2004
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...