A computer system for evaluating the realizability of algorithms of crew activity

Abramov, Alexander P.; Vydruk, D. G.; Федунов, Б. Е.

doi:10.1134/s1064230706040149

Cited by 2 publications

(21 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us call them left sliding sections. (2,3,4,1,6). The parameters of the evaluation function are x 1 = 6, x 2 = 20.…”

Section: A Regularmentioning

confidence: 95%

“…The aggregation procedure for terms of the given sequence in the first segment of the evaluation function. The given sequence is (1,3,2,1,3,2). The parameter of the evaluation function is x 1 = 5.…”

Section: Auxiliary Propositionsmentioning

confidence: 99%

“…The parameter of the evaluation function is x 1 = 4. The generated sequence obtained in the left to right procedure is ((1 + 3), 3, (2 + 2), 3) = (4,3,4,3) In the right to left procedure the same generated sequence is constructed, since it is impossible to add to the last term 3 the term 2 standing before it. (*) C a s e 2.…”

Section: Auxiliary Propositionsmentioning

confidence: 99%

“…The parameter of the evaluation function is x 1 = 4. The left to right procedure results in the generated sequence ((1 + 3), (1 + 2), (2 + 2), (1 + 1)) = (4,3,4,2). The right to left procedure con structs the generated sequence (1, (3 + 1), (2 + 2), (2 + 1 + 1)) = (1,4,4,4).…”

Section: Auxiliary Propositionsmentioning

confidence: 99%

“…Operator decisions are graph nodes. In particular graph arcs, the places of admissible (possible) switching the operator to tracking algorithms are labeled [3]. Each operator decision is evaluated by the time spent by him for its making and subsequent implementa tion.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Optimal generated numerical sequences in problems of placement of tracking segments in evaluating algorithms of operator activity, I

Федунов

2012

J. Comput. Syst. Sci. Int.

Self Cite

View full text Add to dashboard Cite

In designing algorithms of activity of an operator of an anthropocentric object, the problem of evaluating its load by tracking algorithms arises. The mathematical formulation of this problem is as follows: for a given positive numerical sequence with a finite number of terms and a given piecewise linear function, estimating this sequence by the sum of estimates of its terms, find an optimal sequence among the set of sequences (generated sequences) obtained by adding at any single place or in several places any number of adjacent terms. For an arbitrary sequence (from a certain class) under an a priori known piecewise linear function, a computer oriented technique of embedded sliding sections is found that makes it possible to construct a complete set of generated sequences. An algorithm for selecting optimal generated sequences in this set, recalling the algorithm of the R. Bellman dynamic programming, is proposed.

show abstract

“…Let us call them left sliding sections. (2,3,4,1,6). The parameters of the evaluation function are x 1 = 6, x 2 = 20.…”

Section: A Regularmentioning

confidence: 95%

Section: Auxiliary Propositionsmentioning

confidence: 99%