144 search results - page 17 / 29 » Stochastic analyses for online combinatorial optimization pr... |
RSS
2007
14 years 11 months ago
2007
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
81
Voted
JAIR
2006
14 years 9 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
UAI
2004
14 years 11 months ago
2004
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
AUTOMATICA
2008
14 years 9 months ago
2008
It is well known that stochastic control systems can be viewed as Markov decision processes (MDPs) with continuous state spaces. In this paper, we propose to apply the policy iter...