1583 search results - page 68 / 317 » Continuous Optimization |
123
click to vote
WSC
1997
15 years 1 months ago
1997
In this paper we compare the average performance of Monte Carlo methods for global optimization with non-adaptive deterministic alternatives. We analyze the behavior of the algori...
106
click to vote
AUTOMATICA
2007
15 years 1 days ago
2007
The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous....
134
click to vote
OL
2011
14 years 6 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
EOR
2008
14 years 12 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
ML
2002
ACM
14 years 11 months ago
2002
ACM
Abstract. The problemof state abstractionis of centralimportancein optimalcontrol,reinforcement learning and Markov decision processes. This paper studies the case of variable reso...