메뉴 건너뛰기




Volumn 37, Issue 1, 1988, Pages 2-13

Deterministic Learning Automata Solutions to the Equipartitioning Problem

Author keywords

Adaptive learning; attribute partitioning; au ; distributed file allocation; object partitioning problem; record clustering; tomata solutions to partitioning

Indexed keywords

AUTOMATA THEORY; MATHEMATICAL TECHNIQUES - ALGORITHMS;

EID: 0023833454     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.75146     Document Type: Article
Times cited : (90)

References (31)
  • 1
    • 15744403292 scopus 로고
    • An investigation of the moveahead-k-rules
    • Proc. Thirteenth Southeastern Conf. Combinatorics, Graph Theory Comput., Florida, Feb.
    • D. M. Arnow and A. M. Tenenbaum, “An investigation of the moveahead-k-rules,” in Congressus Numerantium, Proc. Thirteenth Southeastern Conf. Combinatorics, Graph Theory Comput., Florida, Feb. 1982, pp. 47-65.
    • (1982) Congressus Numerantium , pp. 47-65
    • Arnow, D.M.1    Tenenbaum, A.M.2
  • 2
    • 0039493677 scopus 로고
    • Heuristics that dynamically organize data structures
    • J. R. Bitner, “Heuristics that dynamically organize data structures,” SIAM J. Comput., vol. 8, pp. 82-110, 1979.
    • (1979) SIAM J. Comput. , vol.8 , pp. 82-110
    • Bitner, J.R.1
  • 3
    • 0040959760 scopus 로고
    • Exegesis of self organizing linear search
    • G. H. Gonnet, J. I. Munro, and H. Suwanda, “Exegesis of self organizing linear search,” SIAM J. Comput., vol. 10, pp. 613-637, 1981.
    • (1981) SIAM J. Comput. , vol.10 , pp. 613-637
    • Gonnet, G.H.1    Munro, J.I.2    Suwanda, H.3
  • 4
    • 84976698424 scopus 로고
    • A heuristic approach to attribute partitioning
    • M. Hammer and B. Niamir, “A heuristic approach to attribute partitioning,” in Proc. ACM SIGMOD Conf., 1979, pp. 93-101.
    • (1979) Proc. ACM SIGMOD Conf. , pp. 93-101
    • Hammer, M.1    Niamir, B.2
  • 5
    • 84975470143 scopus 로고
    • Index selection in a self-adaptive database management system
    • M. Hammar and A. Chan, “Index selection in a self-adaptive database management system,” in Proc. ACM SIGMOD Conf., 1976, pp. 1-8.
    • (1976) Proc. ACM SIGMOD Conf. , pp. 1-8
    • Hammar, M.1    Chan, A.2
  • 6
    • 0004183562 scopus 로고
    • An account of self-organizing systems
    • W. J. Hendricks, “An account of self-organizing systems,” SIAM J. Comput., vol. 5, pp. 715-723, 1976.
    • (1976) SIAM J. Comput. , vol.5 , pp. 715-723
    • Hendricks, W.J.1
  • 7
    • 0039496353 scopus 로고
    • Optimal list order under partial memory constraints
    • Y. C. Kan and S. M. Ross, “Optimal list order under partial memory constraints,” J. Appl. Probability, vol. 17, pp. 1004-1015, 1980.
    • (1980) J. Appl. Probability , vol.17 , pp. 1004-1015
    • Kan, Y.C.1    Ross, S.M.2
  • 8
    • 0003657590 scopus 로고
    • Vol. 3, Sorting and Searching. Reading, MA: Addison-Wesley
    • D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
    • (1973) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 9
    • 0015622095 scopus 로고
    • Absolutely expedient algorithms for stochastic automata
    • Man, Cybern.
    • S. Lakshmivarahan and M. A. L. Thathachar, “Absolutely expedient algorithms for stochastic automata,” IEEE Trans. Syst., Man, Cybern., vol. SMC-3, pp. 281-286, 1973.
    • (1973) IEEE Trans. Syst. , vol.SMC-3 , pp. 281-286
    • Lakshmivarahan, S.1    Thathachar, M.A.L.2
  • 11
    • 84943679387 scopus 로고
    • A clustered search algorithm incorporating arbitrary term dependencies
    • Univ. Illinois, Chicago Circle
    • K. Lam and C. T. Yu, “A clustered search algorithm incorporating arbitrary term dependencies,” Dep. Inform. Eng., Univ. Illinois, Chicago Circle, 1978.
    • (1978) Dep. Inform. Eng.
    • Lam, K.1    Yu, C.T.2
  • 12
    • 84863663380 scopus 로고
    • An approximation algorithm for a file allocation problem in a hierarchical distributed system
    • —, “An approximation algorithm for a file allocation problem in a hierarchical distributed system,” in Proc. ACM SIGMOD Conf., 1980, pp. 125-132.
    • (1980) Proc. ACM SIGMOD Conf. , pp. 125-132
  • 13
    • 0001580268 scopus 로고
    • On serial files with relocatable records
    • J. McCabe, “On serial files with relocatable records,” Oper. Res., vol. 12, pp. 609-618, 1965.
    • (1965) Oper. Res. , vol.12 , pp. 609-618
    • McCabe, J.1
  • 14
    • 0016082525 scopus 로고
    • Learning automata—A survey
    • Man, Cybern.
    • K. S. Narendra and M. A. L. Thathachar, “Learning automata—A survey,” IEEE Trans. Syst., Man, Cybern., vol. SMC-4, pp. 323-334, 1974.
    • (1974) IEEE Trans. Syst. , vol.SMC-4 , pp. 323-334
    • Narendra, K.S.1    Thathachar, M.A.L.2
  • 15
    • 0018907738 scopus 로고
    • On the behavior of a learning automaton in a changing environment with routing applications
    • Man, Cybern.
    • —, “On the behavior of a learning automaton in a changing environment with routing applications,” IEEE Trans. Syst., Man, Cybern., vol. SMC-10, pp. 262-269, 1980.
    • (1980) IEEE Trans. Syst. , vol.SMC-10 , pp. 262-269
  • 16
    • 0017556836 scopus 로고
    • Application of learning automata to telephone traffic routing
    • Man, Cybern.
    • K. S. Narendra, E. Wright, and L. G. Mason, “Application of learning automata to telephone traffic routing,” IEEE Trans. Syst., Man, Cybern., vol. SMC-7, pp. 785-792, 1977.
    • (1977) IEEE Trans. Syst. , vol.SMC-7 , pp. 785-792
    • Narendra, K.S.1    Wright, E.2    Mason, L.G.3
  • 17
    • 0021432680 scopus 로고
    • The asymptotic optimality of two action discretized linear reward-inaction learning automata
    • Man, Cybern., May
    • B. J. Oommen and E. R. Hansen, “The asymptotic optimality of two action discretized linear reward-inaction learning automata,” IEEE Trans. Syst., Man, Cybern., pp. 542-545, May/June 1984.
    • (1984) IEEE Trans. Syst. , pp. 542-545
    • Oommen, B.J.1    Hansen, E.R.2
  • 18
    • 0022581279 scopus 로고
    • Absorbing and ergodic discretized two action learning automata
    • Man, Cybern.
    • B.J. Oommen, “Absorbing and ergodic discretized two action learning automata,” IEEE Trans. Syst., Man, Cybern., pp. 282-293, 1986.
    • (1986) IEEE Trans. Syst. , pp. 282-293
    • Oommen, B.J.1
  • 19
    • 84909820152 scopus 로고
    • On the use of smoothsort and stochastic move-to-front operations for optimal list organization
    • Oct.
    • —, “On the use of smoothsort and stochastic move-to-front operations for optimal list organization,” in Proc. Twenty-Second Allerton Conf., Oct. 1984, Urbana, IL, pp. 243-252.
    • (1984) Proc. Twenty-Second Allerton Conf. , pp. 243-252
  • 20
    • 0023401714 scopus 로고
    • List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations
    • B. J. Oommen and E. R. Hansen, “List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations,” Siam J. Comput., vol. 16, pp. 705-716, 1987.
    • (1987) Siam J. Comput. , vol.16 , pp. 705-716
    • Oommen, B.J.1    Hansen, E.R.2
  • 21
    • 0016917230 scopus 로고
    • On self organizing sequential search heuristics
    • R. L. Rivest, “On self organizing sequential search heuristics,” Comm. Ass. Comput. Mach., vol. 19, pp. 63-67, 1976.
    • (1976) Comm. Ass. Comput. Mach. , vol.19 , pp. 63-67
    • Rivest, R.L.1
  • 24
    • 84976691066 scopus 로고
    • A clustering algorithm for hierarchical structures
    • M. Schkolnick, “A clustering algorithm for hierarchical structures,” ACM Trans. Database Syst., 1977, pp. 27-44.
    • (1977) ACM Trans. Database Syst. , pp. 27-44
    • Schkolnick, M.1
  • 25
    • 0000502180 scopus 로고
    • On the behavior of finite automata in random media
    • M. L. Tsetlin, “On the behavior of finite automata in random media,” Automat. Telemek., vol. 22, pp. 1345-1354, 1961.
    • (1961) Automat. Telemek. , vol.22 , pp. 1345-1354
    • Tsetlin, M.L.1
  • 27
    • 0017500411 scopus 로고
    • A theoretical basis for the use of co-occurrence data in information retrieval
    • C. J. Van Rijsbergen, “A theoretical basis for the use of co-occurrence data in information retrieval,” J. Documentation, pp. 106-119, 1977.
    • (1977) J. Documentation , pp. 106-119
    • Van Rijsbergen, C.J.1
  • 28
    • 0016881996 scopus 로고
    • Precision weighting—An effective automatic indexing method
    • C. T. Yu and G. Salton, “Precision weighting—An effective automatic indexing method,” J. Ass. Comput. Mach., pp. 76-78, 1976.
    • (1976) J. Ass. Comput. Mach. , pp. 76-78
    • Yu, C.T.1    Salton, G.2
  • 30
  • 31
    • 84943678549 scopus 로고
    • Object partitioning by using learning automata
    • School Comput. Sci., Carleton Univ., Ottawa, Canada, Apr.
    • D. C. Y. Ma, “Object partitioning by using learning automata,” M.C.S. Thesis, School Comput. Sci., Carleton Univ., Ottawa, Canada, Apr. 1986.
    • (1986) M.C.S. Thesis
    • Ma, D.C.Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.