An Optimal Decision Rule for Reallocation of Experts

Author(s):  
Upendra Belhe ◽  
Andrew Kusiak
2002 ◽  
Vol 34 (02) ◽  
pp. 313-328
Author(s):  
Nicole Bäuerle

We consider a general control problem for networks with linear dynamics which includes the special cases of scheduling in multiclass queueing networks and routeing problems. The fluid approximation of the network is used to derive new results about the optimal control for the stochastic network. The main emphasis lies on the average-cost criterion; however, the β-discounted as well as the finite-cost problems are also investigated. One of our main results states that the fluid problem provides a lower bound to the stochastic network problem. For scheduling problems in multiclass queueing networks we show the existence of an average-cost optimal decision rule, if the usual traffic conditions are satisfied. Moreover, we give under the same conditions a simple stabilizing scheduling policy. Another important issue that we address is the construction of simple asymptotically optimal decision rules. Asymptotic optimality is here seen with respect to fluid scaling. We show that every minimizer of the optimality equation is asymptotically optimal and, what is more important for practical purposes, we outline a general way to identify fluid optimal feedback rules as asymptotically optimal. Last, but not least, for routeing problems an asymptotically optimal decision rule is given explicitly, namely a so-called least-loaded-routeing rule.


2013 ◽  
Vol 68 (2) ◽  
pp. 389-391
Author(s):  
Mikhail V Zhitlukhin ◽  
Alexey A Muravlev ◽  
Albert N Shiryaev

Author(s):  
Igor Parkhomey ◽  
Juliy Boiko ◽  
Oleksander Eromenko

<span lang="IN">At the present time, the complexity of identification is to find such a description, in which the image (information) of each class would have identified similar properties. The task is to make the transformed description includes the whole set of input images, united by the similarity class by the given ratio.</span><span lang="IN">Using the ordinates of an autocorrelation function is an inseparable shift in the center of gravity of an image, which leads to a change of such description.</span><span lang="IN">Nicest, the concept of an invariant description of information arises, this is an autocorrelation function, which is invariant to the description of any displacements of the image in the vertical and horizontal directions.</span><span lang="IN">The problem of finding an optimal decision rule arises, which, in a number of cases, can be constructed on the basis of a method, based on the definition of the maximum incomplete coefficient of similarity.</span><span lang="IN">Using this method, the solutions, that are almost unintelligible to the errors that arise due to the effects of interference, are found. Therefore, in increments</span><span lang="EN-US"> k</span><span lang="IN">, this rule passes into the Bayes’ rule.</span>


Sign in / Sign up

Export Citation Format

Share Document