4103 search results - page 136 / 821 » Some results on the Collatz problem |
164
click to vote
EVOW
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of automatically designing maps for first-person shooter (FPS) games. An efficient solution to this procedural content generation (PCG) problem could allow ...
189
click to vote
MP
2011
14 years 9 months ago
2011
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
210
click to vote
JMLR
2012
13 years 9 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
175
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
185
click to vote
AIPS
2006
15 years 8 months ago
2006
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...