메뉴 건너뛰기




Volumn 49, Issue 1-4, 2002, Pages 179-191

G-networks with resets

Author keywords

Existence; Gelenbe networks; Negative customers; Product forms; Queuing networks; Resets; Triggers; Uniqueness

Indexed keywords

CUSTOMER SATISFACTION; MARKOV PROCESSES; NEURAL NETWORKS; PROBLEM SOLVING; THEOREM PROVING; TRIGGER CIRCUITS;

EID: 1642334040     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(02)00127-X     Document Type: Conference Paper
Times cited : (111)

References (13)
  • 1
    • 0016495143 scopus 로고
    • Open, closed and mixed networks of queues with different classes of customers
    • Baskett F., Chandy K., Muntz R.R., Palacios F.G., Open, closed and mixed networks of queues with different classes of customers. J. ACM. 22(2):1975;248-260.
    • (1975) J. ACM , vol.22 , Issue.2 , pp. 248-260
    • Baskett, F.1    Chandy, K.2    Muntz, R.R.3    Palacios, F.G.4
  • 2
    • 0000140889 scopus 로고
    • Queuing networks with negative and positive customers
    • Gelenbe E., Queuing networks with negative and positive customers. J. Appl. Probab. 28:1991;656-663.
    • (1991) J. Appl. Probab. , vol.28 , pp. 656-663
    • Gelenbe, E.1
  • 5
    • 21344498249 scopus 로고
    • G-networks with instantaneous customer movement
    • Gelenbe E., G-networks with instantaneous customer movement. J. Appl. Probab. 30(3):1993;742-748.
    • (1993) J. Appl. Probab. , vol.30 , Issue.3 , pp. 742-748
    • Gelenbe, E.1
  • 6
    • 84976193341 scopus 로고
    • G-Networks with signals and batch removal
    • Gelenbe E., G-Networks with signals and batch removal. Probab. Eng. Inform. Sci. 7:1993;335-342.
    • (1993) Probab. Eng. Inform. Sci. , vol.7 , pp. 335-342
    • Gelenbe, E.1
  • 7
    • 0000428263 scopus 로고
    • Learning in the recurrent random network
    • Gelenbe E., Learning in the recurrent random network. Neural Comput. 5:1993;154-164.
    • (1993) Neural Comput. , vol.5 , pp. 154-164
    • Gelenbe, E.1
  • 8
    • 21344486418 scopus 로고
    • G-networks: An unifying model for queuing networks and neural networks
    • Gelenbe E., G-networks: an unifying model for queuing networks and neural networks. Ann. Oper. Res. 48(1-4):1994;433-461.
    • (1994) Ann. Oper. Res. , vol.48 , Issue.1-4 , pp. 433-461
    • Gelenbe, E.1
  • 9
    • 0030080867 scopus 로고    scopus 로고
    • G-networks with multiple classes of positive and negative customers
    • Fourneau J.M., Gelenbe E., Suros R., G-networks with multiple classes of positive and negative customers. Theoret. Comput. Sci. 155:1996;141-156.
    • (1996) Theoret. Comput. Sci. , vol.155 , pp. 141-156
    • Fourneau, J.M.1    Gelenbe, E.2    Suros, R.3
  • 10
    • 0004950826 scopus 로고    scopus 로고
    • G-networks with multiple classes of signals and positive customers
    • Gelenbe E., Labed A., G-networks with multiple classes of signals and positive customers. Eur. J. Oper. Res. 108(2):1998;293-305.
    • (1998) Eur. J. Oper. Res. , vol.108 , Issue.2 , pp. 293-305
    • Gelenbe, E.1    Labed, A.2
  • 12
    • 0034675407 scopus 로고    scopus 로고
    • G-networks: A versatile approach for work removal in queuing networks
    • Artalejo J.R., G-networks: a versatile approach for work removal in queuing networks. Eur. J. Oper. Res. 126:2000;233-249.
    • (2000) Eur. J. Oper. Res. , vol.126 , pp. 233-249
    • Artalejo, J.R.1
  • 13
    • 0347497862 scopus 로고    scopus 로고
    • Feature issue on G-networks
    • Feature issue on G-networks, Eur. J. Oper. Res. 126 (2000).
    • (2000) Eur. J. Oper. Res. , vol.126


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