메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 1424-1426

Experimental analysis of privacy loss in DCOP algorithms

Author keywords

Constraint reasoning; DCOP; Privacy

Indexed keywords

DISTRIBUTED CONSTRAINT OPTIMIZATION (DCOP); PRIVACY LOSS; QUANTITATIVE EVALUATIONS;

EID: 34247234547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160899     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 1
    • 33750712579 scopus 로고    scopus 로고
    • Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality
    • M. S. F.Rossi, E. C. Freuder, and R. Wallace. Multi-agent meeting scheduling with preferences: efficiency, privacy loss, and solution quality. Computational Intelligence, 20(2), 2004.
    • (2004) Computational Intelligence , vol.20 , Issue.2
    • Rossi, M.S.F.1    Freuder, E.C.2    Wallace, R.3
  • 3
    • 33646000597 scopus 로고    scopus 로고
    • Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications
    • R. T. Maheswaran, J. P. Pearce, E. Bowring, P. Varakantham, and M. Tambe. Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications. JAAMAS, 2006.
    • (2006) JAAMAS
    • Maheswaran, R.T.1    Pearce, J.P.2    Bowring, E.3    Varakantham, P.4    Tambe, M.5
  • 4
    • 32944465231 scopus 로고    scopus 로고
    • Valuations of possible states (VPS):a quantitative framework for analysis of privacy loss among collaborative personal assistant agents
    • R. T. Maheswaran, J. P. Pearce, P. Varakantham, E. Bowring, and M. Tambe. Valuations of possible states (VPS):a quantitative framework for analysis of privacy loss among collaborative personal assistant agents. In AAMAS, 2005.
    • (2005) AAMAS
    • Maheswaran, R.T.1    Pearce, J.P.2    Varakantham, P.3    Bowring, E.4    Tambe, M.5
  • 5
    • 4544376849 scopus 로고    scopus 로고
    • Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling
    • R. T. Maheswaran, M. Tambe, E. Bowring, J. P. Pearce, and P. Varakantham. Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling. In AAMAS, 2004.
    • (2004) AAMAS
    • Maheswaran, R.T.1    Tambe, M.2    Bowring, E.3    Pearce, J.P.4    Varakantham, P.5
  • 6
    • 34247231248 scopus 로고    scopus 로고
    • A. Meisels and O. Lavee. Using additional information in DisCSPs search. In DCR, 2004.
    • A. Meisels and O. Lavee. Using additional information in DisCSPs search. In DCR, 2004.
  • 7
    • 10044277219 scopus 로고    scopus 로고
    • ADOPT: Asynchronous distributed constraint optimization with quality guarantees
    • P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. A rtificial Intelligence Journal, 161:149-180, 2005.
    • (2005) A rtificial Intelligence Journal , vol.161 , pp. 149-180
    • Modi, P.J.1    Shen, W.2    Tambe, M.3    Yokoo, M.4
  • 8
    • 84880707137 scopus 로고    scopus 로고
    • A scalable method for multiagent constraint optimization
    • A. Petcu and B. Faltings. A scalable method for multiagent constraint optimization. In IJCAI, 2005.
    • (2005) IJCAI
    • Petcu, A.1    Faltings, B.2
  • 9
    • 34247227808 scopus 로고    scopus 로고
    • M. C. Silaghi and B. Fallings. A comparison of distributed constraint satisfaction approaches with respect to privacy. In DCR, 2002.
    • M. C. Silaghi and B. Fallings. A comparison of distributed constraint satisfaction approaches with respect to privacy. In DCR, 2002.
  • 10
    • 15544367557 scopus 로고    scopus 로고
    • Meeting scheduling guaranteeing n/2-privacy and resistant to statistical analysis (applicable to any discsp)
    • M.C. Silaghi. Meeting scheduling guaranteeing n/2-privacy and resistant to statistical analysis (applicable to any discsp). In 3rd IC on Web Intelligence, 2004.
    • (2004) 3rd IC on Web Intelligence
    • Silaghi, M.C.1
  • 11
    • 4544364879 scopus 로고    scopus 로고
    • Secure distributed constraint satisfaction: Reaching agreement without revealing private information
    • Berlin
    • M. Yokoo, K. Suzuki, and K. Hirayama. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In CP 2002, Berlin, 2002.
    • (2002) CP 2002
    • Yokoo, M.1    Suzuki, K.2    Hirayama, K.3


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