메뉴 건너뛰기




Volumn 3, Issue , 2001, Pages 1841-1847

Computing budget allocation for optimization of sensor processing order in sequential multi-sensor fusion algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; STATISTICAL METHODS;

EID: 0034840855     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2001.946004     Document Type: Conference Paper
Times cited : (8)

References (19)
  • 2
    • 0016552254 scopus 로고
    • Tracking in a cluttered environment with probabilistic data association
    • Sept.
    • (1975) Automatica , vol.11 , Issue.5 , pp. 451-460
    • Bar-Shalom, Y.1    Tse, E.2
  • 4
    • 0030212017 scopus 로고    scopus 로고
    • A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
    • Aug.
    • (1996) IEEE Trans. Automatic Control , vol.41 , Issue.8 , pp. 1227-1231
    • Chen, C.H.1
  • 10
    • 0031703392 scopus 로고    scopus 로고
    • Alternatives to Monte-Carlo simulation evaluations of two multisensor fusion algorithms
    • Jan.
    • (1998) Automatica , vol.34 , Issue.1 , pp. 103-110
    • Frei, C.W.1    Pao, L.Y.2
  • 11
    • 0000605519 scopus 로고
    • On selecting a subset containing the population with the smallest variance
    • Dec.
    • (1962) Biometrika , vol.49 , Issue.3-4 , pp. 495-507
    • Gupta, S.S.1    Sobel, M.2
  • 12
    • 0033079708 scopus 로고    scopus 로고
    • An explanation of ordinal optimization: Soft computing for hard problems
    • Feb.
    • (1999) Information Sciences , vol.113 , Issue.3-4 , pp. 169-192
    • Ho, Y.C.1
  • 16


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