2899 search results - page 149 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
158
Voted
WSC
2001
15 years 7 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
168
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
135
Voted
CEJCS
2011
14 years 6 months ago
2011
: Network analytic method designed for the analysis of static networks promise to identify significant relational patterns that correlate with important structures in the complex ...
136
click to vote
APPML
2007
15 years 6 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
182
click to vote
ALDT
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...