Results 241 to 250 of about 715,075 (267)
Some of the next articles are maybe not open access.
Discrete Parameter Optimization
2013In this chapter, we consider the case when optimization has to be performed over a parameter set that is discrete valued and has a finite number of points. We present adaptations of the SPSA and SF algorithms discussed previously using certain projection mappings. We consider here the case of a long-run average cost objective.
S. Bhatnagar, H. Prasad, L. Prashanth
openaire +1 more source
Discrete Mathematics and Applications, 1998
This paper is about a process \(\{\underline W_i,\;i\in [1:n]\}\) built as follows: \[ \underline W_i= {U_i\brack V_i},\quad 1\leq i\leq n, \] where 1. \(\{U_i,\;i\in [1:n]\}\) is a given (deterministic) unobservable sequence of zeros and ones which contains at least one sequence of zeros and one sequence of ones, both of length \(p\). 2.
Gladkov, B. V., Datsenko-Chigorin, A. N.
openaire +1 more source
This paper is about a process \(\{\underline W_i,\;i\in [1:n]\}\) built as follows: \[ \underline W_i= {U_i\brack V_i},\quad 1\leq i\leq n, \] where 1. \(\{U_i,\;i\in [1:n]\}\) is a given (deterministic) unobservable sequence of zeros and ones which contains at least one sequence of zeros and one sequence of ones, both of length \(p\). 2.
Gladkov, B. V., Datsenko-Chigorin, A. N.
openaire +1 more source
Discrete Structural Optimization
Journal of the Structural Division, 1971The application of discrete programming to structural optimization permits the use of tabulated section properties and eliminates the need for approximate relations, such as between weight and section modulus, which may obscure the optimal solution.
openaire +1 more source
Journal of the Society for Industrial and Applied Mathematics, 1965
Reiter, Stanley, Sherman, Gordon
openaire +2 more sources
Reiter, Stanley, Sherman, Gordon
openaire +2 more sources