메뉴 건너뛰기




Volumn 14, Issue 3, 2001, Pages 213-232

The traveling agent problem

Author keywords

Dynamic programming; Intelligent agents; Mobile agents; Planning; Stochastic control

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DYNAMIC PROGRAMMING; INTELLIGENT AGENTS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

EID: 0034854892     PISSN: 09324194     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009883     Document Type: Article
Times cited : (22)

References (21)
  • 13
    • 0003666178 scopus 로고
    • Scheduling a production line to minimize maximum tardiness
    • Research Report 43, Management Science Research Project, University of California, Los Angeles, CA
    • (1955)
    • Jackson, J.R.1
  • 17
    • 0003700368 scopus 로고    scopus 로고
    • The mobile-agent planning problem
    • Ph.D. Thesis, Thayer School of Engineering, Dartmouth College, Hanover, NH, 1998
    • Moizumi, K.1
  • 18
    • 0003900532 scopus 로고    scopus 로고
    • Ingress planning in FASM
    • ALPHATECH Technical Report, Burlington, MA
    • (1997)
    • Patek, S.1
  • 21
    • 0003952912 scopus 로고
    • Telescript technology: The foundation for the electronic marketplace
    • General Magic White Paper, General Magic
    • (1994)
    • White, J.E.1


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