20294 search results - page 424 / 4059 » Algorithmic Information Theory |
221
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
185
click to vote
MM
2010
ACM
15 years 7 months ago
2010
ACM
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
220
click to vote
PERCOM
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
220
click to vote
SIAMJO
2010
15 years 6 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
181
click to vote
SIAMJO
2010
15 years 6 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...