메뉴 건너뛰기




Volumn 4, Issue , 2003, Pages 2635-2641

A k-elitist max-min ant system approach to cost-based abduction

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS;

EID: 4644272591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299420     Document Type: Conference Paper
Times cited : (13)

References (21)
  • 1
    • 0032156130 scopus 로고    scopus 로고
    • An algorithm for finding MAPs for belief networks through cost-based abduction
    • A. M. Abdelbar. An algorithm for finding MAPs for belief networks through cost-based abduction. Artificial Intelligence. Vol. 104. pp. 331-338. 1998.
    • (1998) Artificial Intelligence , vol.104 , pp. 331-338
    • Abdelbar, A.M.1
  • 6
    • 0028408874 scopus 로고
    • Cost-based abduction and MAP explanation
    • E. Charniak, and S. Shimony. Cost-based abduction and MAP explanation. Artificial Intelligence, Vol. 66, pp. 345-374, 1994.
    • (1994) Artificial Intelligence , vol.66 , pp. 345-374
    • Charniak, E.1    Shimony, S.2
  • 9
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo, and L. M. Gambardella. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, Vol. 1, pp. 53-66, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 15
    • 0031100429 scopus 로고    scopus 로고
    • Networked bubble propagation: A polynomial-time hypothetical reasoning method for computing near-optimal solutions
    • Y. Ohsawa, and M. Ishizuka. Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions. Artificial Intelligence. Vol. 91, pp. 131-154, 1997.
    • (1997) Artificial Intelligence , vol.91 , pp. 131-154
    • Ohsawa, Y.1    Ishizuka, M.2
  • 16
  • 17
    • 0028257241 scopus 로고
    • A linear constraint satisfaction approach to cost-based abduction
    • E. Santos Jr. A linear constraint satisfaction approach to cost-based abduction. Artificial Intelligence, 65 (1994) 1-27.
    • (1994) Artificial Intelligence , vol.65 , pp. 1-27
    • Santos Jr., E.1
  • 18
    • 0030246424 scopus 로고    scopus 로고
    • Polynomial solvability of cost-based abduction
    • E. Santos Jr., and E. S. Santos. Polynomial solvability of cost-based abduction. Artificial Intelligence 86 (1996) 157-170.
    • (1996) Artificial Intelligence , vol.86 , pp. 157-170
    • Santos Jr., E.1    Santos, E.S.2


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