27692 search results - page 277 / 5539 » Where is ... |
110
Voted
JAIR
2010
15 years 1 months ago
2010
We study a setting where a principal needs to motivate a team of agents whose combination of hidden efforts stochastically determines an outcome. In a companion paper we devise an...
105
Voted
JAT
2010
15 years 1 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
121
Voted
TON
2008
15 years 1 months ago
2008
In a multiple-choice hashing scheme, each item is stored in one of 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in t...
102
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
114
click to vote
OL
2010
15 years 1 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...