3049 search results - page 177 / 610 » On the Convergence of Bound Optimization Algorithms |
330
click to vote
CC
2011
Springer
14 years 10 months ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
162
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
184
click to vote
SIAMJO
2010
15 years 1 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
127
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— This paper presents a solution to decentralized Voronoi coverage in non-convex polygonal environments. We show that complications arise when existing approaches to Voronoi cove...
237
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...