메뉴 건너뛰기




Volumn 37, Issue 2, 1996, Pages 85-93

A bidirectional search approach for restoring circuits in communication networks

Author keywords

Distributed artificial intelligence; Error recovery; Least cost; Network operations; Network reliability; Restoral circuit; Routing; Search algorithm

Indexed keywords

DISTRIBUTED ARTIFICIAL INTELLIGENCE; LEAST-COST; NETWORK OPERATIONS; NETWORK RELIABILITY; ROUTING; SEARCH ALGORITHMS;

EID: 0242479214     PISSN: 08874417     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (5)

References (27)
  • 3
    • 0026258186 scopus 로고
    • Multistage Negotiation for Distributed Constraint Satisfaction
    • November/December
    • Conry, S., K. Kuwabara, and V. Lesser. "Multistage Negotiation for Distributed Constraint Satisfaction," IEEE Transactions on Systems, Man and Cybernetics, 21:6, November/December 1991, pp. 1462-1477.
    • (1991) IEEE Transactions on Systems, Man and Cybernetics , vol.21 , Issue.6 , pp. 1462-1477
    • Conry, S.1    Kuwabara, K.2    Lesser, V.3
  • 4
    • 0002503336 scopus 로고
    • Multistage Negotiation in Distributed Planning
    • Bond, A. and L. Gasser (Eds.), Morgan Kaufmann
    • Conry, S., R. Meyer, and V. Lesser. "Multistage Negotiation in Distributed Planning," in Bond, A. and L. Gasser (Eds.), Readings in Distributed Artificial Intelligence, Morgan Kaufmann, 1988, pp. 367-383.
    • (1988) Readings in Distributed Artificial Intelligence , pp. 367-383
    • Conry, S.1    Meyer, R.2    Lesser, V.3
  • 8
    • 0017450139 scopus 로고
    • A Minimum Delay Routing Algorithm Using Distributed Computation
    • Gallagher, R. "A Minimum Delay Routing Algorithm Using Distributed Computation," IEEE Transactions on Communications, COM-25:1, 1977, pp. 73-85.
    • (1977) IEEE Transactions on Communications , vol.COM-25 , Issue.1 , pp. 73-85
    • Gallagher, R.1
  • 15
    • 0022129301 scopus 로고
    • Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
    • Korf, R.E. "Depth-First Iterative-Deepening: An Optimal Admissible Tree Search," Artificial Intelligence, 27, 1985, pp. 97-109.
    • (1985) Artificial Intelligence , vol.27 , pp. 97-109
    • Korf, R.E.1
  • 18
    • 0041305675 scopus 로고
    • An Overview of DAI: Viewing Distributed AI as Distributed Search
    • Lesser, V. "An Overview of DAI: Viewing Distributed AI as Distributed Search," J. Japanese Society, Artificial Intelligence, 5:4, 1990.
    • (1990) J. Japanese Society, Artificial Intelligence , vol.5 , Issue.4
    • Lesser, V.1
  • 22
    • 0004286550 scopus 로고
    • Addison-Wesley
    • Pearl, J. Heuristics, Addison-Wesley, 1984, pp. 63-64.
    • (1984) Heuristics , pp. 63-64
    • Pearl, J.1
  • 23
    • 0000307659 scopus 로고
    • Bi-Directional Search
    • Pohl, I. "Bi-Directional Search," Machine Intelligence, 1971, nr 6, pp. 127-140.
    • (1971) Machine Intelligence , Issue.6 , pp. 127-140
    • Pohl, I.1
  • 26
    • 0021853534 scopus 로고
    • A New Heuristic Search Technique-Algorithm SA
    • Zhang, B. and L. Zhang. "A New Heuristic Search Technique-Algorithm SA," IEEE Transaction on PAMI, 7:1, 1985, pp. 103-107.
    • (1985) IEEE Transaction on PAMI , vol.7 , Issue.1 , pp. 103-107
    • Zhang, B.1    Zhang, L.2


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