메뉴 건너뛰기




Volumn 141, Issue , 2006, Pages 103-107

Asynchronous forward-bounding for distributed constraints optimization

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINED OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS;

EID: 84876184212     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (26)

References (19)
  • 1
    • 10044279570 scopus 로고    scopus 로고
    • Asynchronous backtracking without adding links: A new member in the abt family
    • (January)
    • C. Bessiere, A. Maestre, I. Brito, and P. Meseguer, 'Asynchronous backtracking without adding links: a new member in the abt family', Artificial Intelligence, 161:1-2, 7-24, (January 2005).
    • (2005) Artificial Intelligence , vol.161 , Issue.1-2 , pp. 7-24
    • Bessiere, C.1    Maestre, A.2    Brito, I.3    Meseguer, P.4
  • 2
    • 72949117182 scopus 로고    scopus 로고
    • Distributed personnel scheduling: Negotiation among scheduling agents
    • E. Kaplansky and A. Meisels, 'Distributed personnel scheduling: Negotiation among scheduling agents', Annals of Operations Research, (2005).
    • (2005) Annals of Operations Research
    • Kaplansky, E.1    Meisels, A.2
  • 3
    • 0003637274 scopus 로고    scopus 로고
    • Phase transition in max-csp
    • In Budapest
    • J. Larrosa and P. Meseguer, 'Phase transition in max-csp', in Proc. ECAI-96, Budapest, (1996).
    • (1996) Proc. ECAI-96
    • Larrosa, J.1    Meseguer, P.2
  • 5
    • 1242330173 scopus 로고    scopus 로고
    • In the quest for the best form of local consistency for wieghted csp
    • In Acapulco
    • J. Larrosa and T. Scheix, 'In the quest for the best form of local consistency for wieghted csp', in Proc. IJCAI-2003, Acapulco, (2003).
    • (2003) Proc. IJCAI-2003
    • Larrosa, J.1    Scheix, T.2
  • 6
    • 4644326185 scopus 로고    scopus 로고
    • Solving weighted csp by maintaining arc consistency
    • J. Larrosa and T. Schiex, 'Solving weighted csp by maintaining arc consistency.', Artificial Intelligence, 159, 1-26, (2004).
    • (2004) Artificial Intelligence , vol.159 , pp. 1-26
    • Larrosa, J.1    Schiex, T.2
  • 8
    • 4544376849 scopus 로고    scopus 로고
    • Taking dcop to the real world: Efficient complete solutions for distributed multi-event scheduling
    • In New York, (July)
    • 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 Proc. AAMAS-2004, New York, (July 2004).
    • (2004) Proc. AAMAS-2004
    • Maheswaran, T.1    Tambe, M.2    Bowring, E.3    Pearce, J.P.4    Varakantham, P.5
  • 9
    • 4544306842 scopus 로고    scopus 로고
    • Solving distributed constraint optimization problems using cooperative mediation
    • (July)
    • Roger Mailer and Victor Lesser, 'Solving distributed constraint optimization problems using cooperative mediation', in Proc. AAMAS-2004, pp. 438-445, (July 2004).
    • (2004) Proc. AAMAS-2004 , pp. 438-445
    • Mailer, R.1    Lesser, V.2
  • 12
    • 10044277219 scopus 로고    scopus 로고
    • Adopt: Asynchronous distributed constraints optimization with quality guarantees
    • (January)
    • P. J. Modi, W. Shen, M. Tambe, and M. Yokoo, 'Adopt: asynchronous distributed constraints optimization with quality guarantees', Artificial Intelligence, 161:1-2, 149-180, (January 2005).
    • (2005) Artificial Intelligence , vol.161 , Issue.1-2 , pp. 149-180
    • Modi, P.J.1    Shen, W.2    Tambe, M.3    Yokoo, M.4
  • 14
    • 65349104346 scopus 로고    scopus 로고
    • A value ordering heuristic for distributed resource allocation
    • A. Petcu and B. Faltings, 'A value ordering heuristic for distributed resource allocation', in Proc. CSCLP04, Lausanne, Switzerland, http://liawww.epfl.ch/Publications/Archive/Petcu2004.pdf, (2004).
    • (2004) Proc. CSCLP04, Lausanne, Switzerland
    • Petcu, A.1    Faltings, B.2
  • 15
    • 0030110022 scopus 로고    scopus 로고
    • An empirical study of phase transitions in binary constraint satisfaction problems
    • P. Prosser, 'An empirical study of phase transitions in binary constraint satisfaction problems', Artificial Intelligence, 81, 81-109, (1996).
    • (1996) Artificial Intelligence , vol.81 , pp. 81-109
    • Prosser, P.1
  • 16
    • 84957868254 scopus 로고    scopus 로고
    • Modeling and solving distributed constraint satisfaction problems (dcsps)
    • New Hamphshire, (October)
    • G. Solotorevsky, E. Gudes, and A. Meisels, 'Modeling and solving distributed constraint satisfaction problems (dcsps)', in Constraint Processing-96, pp. 561-2, New Hamphshire, (October 1996).
    • (1996) Constraint Processing-96 , pp. 561-562
    • Solotorevsky, G.1    Gudes, E.2    Meisels, A.3
  • 17
    • 0034411116 scopus 로고    scopus 로고
    • Algorithms for distributed constraint satisfaction problems: A review
    • M. Yokoo, 'Algorithms for distributed constraint satisfaction problems: A review', Autonomous Agents & Multi-Agent Sys., 3, 198-212, (2000).
    • (2000) Autonomous Agents & Multi-Agent Sys. , vol.3 , pp. 198-212
    • Yokoo, M.1
  • 18
    • 10044270060 scopus 로고    scopus 로고
    • Distributed stochastic search and distributed breakout: Properties, comparishon and applications to constraints optimization problems in sensor networks
    • (January)
    • W. Zhang, Z. Xing, G. Wang, and L. Wittenburg, 'Distributed stochastic search and distributed breakout: properties, comparishon and applications to constraints optimization problems in sensor networks', Artificial Intelligence, 161:1-2, 55-88, (January 2005).
    • (2005) Artificial Intelligence , vol.161 , Issue.1-2 , pp. 55-88
    • Zhang, W.1    Xing, Z.2    Wang, G.3    Wittenburg, L.4


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