메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 351-352

A high throughput approach to combinatorial search on grids

Author keywords

[No Author keywords available]

Indexed keywords

GRID RESOURCES; RUNTIME COLLABORATION; TREE GRAFTING ALGORITHMS;

EID: 33845898231     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (9)
  • 1
    • 0036187455 scopus 로고    scopus 로고
    • A parallel learning algorithm for Bayesian inference networks
    • January
    • W. Lam and A.M. Segre, "A Parallel Learning Algorithm for Bayesian Inference Networks", IEEE Transactions on Knowledge and Data Engineering, 14:1, January 2002, pp. 93-105.
    • (2002) IEEE Transactions on Knowledge and Data Engineering , vol.14 , Issue.1 , pp. 93-105
    • Lam, W.1    Segre, A.M.2
  • 3
    • 0036723620 scopus 로고    scopus 로고
    • Nagging: A scalable, fault-tolerant, paradigm for distributed search
    • September
    • A.M. Segre, S. Foreman, G. Resta, and A. Wildenberg, "Nagging: A Scalable, Fault-Tolerant, Paradigm for Distributed Search", Artificial Intelligence, 140:1-2, September 2002, pp. 71-106.
    • (2002) Artificial Intelligence , vol.140 , Issue.1-2 , pp. 71-106
    • Segre, A.M.1    Foreman, S.2    Resta, G.3    Wildenberg, A.4
  • 4
    • 33845898029 scopus 로고    scopus 로고
    • NSF TeraGrid, http://www.teragrid.org .
  • 5
    • 33845906728 scopus 로고    scopus 로고
    • Open Science Grid, http://www.opensciencegrid.org


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