메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1452-1457

MB-DPOP: A new memory-bounded algorithm for distributed optimization

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMMUNICATION OVERHEADS; DISTRIBUTED OPTIMIZATION; DISTRIBUTED SEARCH; DYNAMIC PROGRAMMING ALGORITHM; HYBRID ALGORITHMS; MEMORY REQUIREMENTS; ORDERS OF MAGNITUDE;

EID: 84880889558     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (61)

References (13)
  • 1
    • 0035250750 scopus 로고    scopus 로고
    • Recursive conditioning
    • Adnan Darwiche. Recursive conditioning. Artif. Intell., 126(1-2):5-41, 2001.
    • (2001) Artif. Intell. , vol.126 , Issue.1-2 , pp. 5-41
    • Darwiche, A.1
  • 3
    • 0022144787 scopus 로고
    • A sufficient condition for backtrack-bounded search
    • Eugene C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(14):755-761, 1985.
    • (1985) Journal of the ACM , vol.32 , Issue.14 , pp. 755-761
    • Freuder, E.C.1
  • 4
    • 33750707077 scopus 로고    scopus 로고
    • Unifying cluster-tree decompositions for automated reasoning in graphical models
    • Kalev Kask, Rina Dechter, and Javier Larrosa. Unifying cluster-tree decompositions for automated reasoning in graphical models. Artificial Intelligence, 2005.
    • (2005) Artificial Intelligence
    • Kask, K.1    Dechter, R.2    Larrosa, J.3
  • 5
    • 4544376849 scopus 로고    scopus 로고
    • Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling
    • Rajiv T. Maheswaran, Milind Tambe, Emma Bowring, Jonathan P. Pearce, and Pradeep Varakantham. Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In AAMAS-04, 2004.
    • (2004) AAMAS-04
    • Maheswaran, R.T.1    Tambe, M.2    Bowring, E.3    Pearce, J.P.4    Varakantham, P.5
  • 6
    • 52249104993 scopus 로고    scopus 로고
    • Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems
    • to appear
    • Roger Mailler and Victor Lesser. Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems. Journal of Artificial Intelligence Research (JAIR), 2005. to appear.
    • (2005) Journal of Artificial Intelligence Research (JAIR)
    • Mailler, R.1    Lesser, V.2
  • 8
    • 10044277219 scopus 로고    scopus 로고
    • ADOPT: Asynchronous distributed constraint optimization with quality guarantees
    • Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. AI Journal, 161:149-180, 2005.
    • (2005) AI Journal , vol.161 , pp. 149-180
    • Modi, P.J.1    Shen, W.-M.2    Tambe, M.3    Yokoo, M.4
  • 12
    • 0034140791 scopus 로고    scopus 로고
    • Resolution versus search: Two strategies for SAT
    • Irina Rish and Rina Dechter. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning, 24(1/2):225-275, 2000.
    • (2000) Journal of Automated Reasoning , vol.24 , Issue.1-2 , pp. 225-275
    • Rish, I.1    Dechter, R.2


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