Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

OPTIMAL POLICY NETWORKS

  • Lim, Jong Seul (Information Communication Engineering Department, Sunmoon University)
  • Received : 2013.03.27
  • Accepted : 2013.05.29
  • Published : 2013.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper focuses on the situation of optimizing the total cost with m given messages and n network nodes. Associated with each network node, a fixed cost is incurred to the receiver if at least one message is received. The mean and variance of the total costs are obtained. Normal approximation is used. Empirical results showed that the derived method reduces research work substantially.

Keywords

References

  1. Cornuejols, Gerard, Fisher, and L. Marshall, Location of Bank Accounts of Optimize Float: An Analytic Study of Exact and Approximate Algorithms, Manage Science 23 (1997), 789-810.
  2. Cramer and Harold, Mathematical Methods of Statistics, Princeton University Press, Princeton, NJ, 1999.
  3. D. Ryu and H. Kim, Convergence of Linear Processes with The Negatively Dependent random Variables, J. Appl. Math. & Informatics 20 (2006), 603-610.
  4. Feller and William, An Introduction to Probability Theory and Its Applications, Vol. I, Third Edition John Wiley and Sons, Inc., New York, NY 1991.
  5. J. Johannes and R. Schenk, Adaptive Estimation of Linear Functionals in Functional Linear Models, Mathematical Methods of Statistics 21 (2012), 189-214. https://doi.org/10.3103/S1066530712030027