Determining optimal polling frequency using a learning automata-based solution to the fractional knapsack problem

2006 IEEE Conference on Cybernetics and Intelligent Systems

Volumn , Issue , 2006, Pages

  Granmo, Ole Christoffer ^a   Oommen, B John ^b,c   Myrer, Svein A ^a   Olsen, Morten G ^a  

^a UNIVERSITY OF AGDER   (Norway)

^b CARLETON UNIVERSITY   (Canada)

^c IEEE   (Canada)

Author keywords

Learning automata; Nonlinear knapsack problems; Resource allocation; Stochastic optimization

Indexed keywords

FRACTIONAL KNAPSACK PROBLEMS; LEARNING AUTOMATA; NONLINEAR KNAPSACK PROBLEMS; STOCHASTIC OPTIMIZATION; CONTROLLED RANDOM WALKS; DETERMINISTIC LEARNING; NEAR-OPTIMAL SOLUTIONS; RESOURCE ALLOCATION PROBLEM; RESTRICTED CAPACITIES; STOCHASTIC OPTIMIZATIONS;

AUTOMATA THEORY; DISCRETE TIME CONTROL SYSTEMS; OPTIMIZATION; RESOURCE ALLOCATION; STOCHASTIC CONTROL SYSTEMS; COMBINATORIAL OPTIMIZATION; CYBERNETICS; ECONOMICS; ESTIMATION; INTELLIGENT SYSTEMS; OPTIMAL SYSTEMS; STOCHASTIC SYSTEMS;

LEARNING SYSTEMS; AUTOMATA THEORY;

EID: 42749102996     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIS.2006.252228     Document Type: Conference Paper

References (16)

1. S. Pandey, K. Ramamtitham, and S. Chakrabatti, "Monitoring the Dynamic Web to Respond to Continuous Queries," in 12th International World Wide Web Conference. ACM Press, 2003, pp. 659-668.
2. J. L. Wolf, M. S. Squillante, J. Sethuratnan, and K. Ozsen, "Optimal Crawling Strategies for Web Search Engines," in 11th International World Wide Web Conference. ACM Press, 2002, pp. 136-147.
3. K. M. Bretthauer and B. Shetty, 'The Nonlinear Knapsack Problem - Algorithms and Applications," European Journal of Operational Research, vol. 138, pp. 459-472, 2002.
4. Q. Zhu and B. J. Oommen, "Some Fundamental Results on Optimal Search with Unknown Target Distributions," Submitted for Publication, 2005.
5. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
6. P. E. Black, "Fractional knapsack problem," Dictionary of Algorithms and Data Structures, 2004.
7. B. Fox, "Discrete optimization via marginal analysis," Management Sciences, vol. 13, no. 3, pp. 211-216, 1966.
8. B. C. Dean, M. X. Goetnans, and J. Vondrdk, "Approximating the Stochastic Knapsack Problem: the benefit of adaptivity," in 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 2004, pp. 208-217.
9. E. Steinberg and M. S. Parks, "A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards," The Journal of the Operational Research Society, vol. 30, no. 2, pp. 141-147, 1979.
10. K. W. Ross and D. Tsang, 'The stochastic knapsack problem," IEEE Transactions on Communications, vol. 37, no. 7, 1989.
11. K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction. Prentice Hall, 1989.
12. M. A. L. Thathachar and P. S. Sastry, Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, 2004.
13. M. L. Tsetlin, Automaton Theory and Modeling of Biological Systems. Academic Press, 1973.
14. B. J. Oommen, "Stochastic searching on the line and its applications to parameter learning in nonlinear optimization," IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 27, no. 4, pp. 733-739, 1997.
15. C. Castillo, "Effective web crawling," Ph.D. dissertation, University of Chile, 2004.
16. G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.