952 search results - page 102 / 191 » Computational complexity of stochastic programming problems |
165
click to vote
ICRA
2009
IEEE
16 years 25 days ago
2009
IEEE
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
155
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
A novel adaptive and patch-based approach is proposed for image regularization and representation. The method is unsupervised and based on a pointwise selection of small image patc...
157
click to vote
JAIR
2008
15 years 6 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
182
click to vote
FSTTCS
2009
Springer
16 years 23 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
180
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...