메뉴 건너뛰기




Volumn 24, Issue 2, 2006, Pages 143-154

Meetings scheduling solver enhancement with local consistency reinforcement

Author keywords

Local consistency enforcement; Meeting scheduling problems; Multi agent system; Valued distributed constraint satisfaction problems

Indexed keywords

COMBINATORIAL PROBLEMS; COMPARATIVE ANALYSIS; LOCAL CONSISTENCY ENFORCEMENT; MEETING SCHEDULING (MS); VALUED DISTRIBUTED CONSTRAINT SATISFACTION PROBLEMS;

EID: 33644995743     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-006-6935-y     Document Type: Article
Times cited : (8)

References (22)
  • 1
    • 0032596381 scopus 로고    scopus 로고
    • Nurse scheduling using constraint logic programming
    • Abdennadher S, Schlenker H (1999) Nurse scheduling using constraint logic programming. In: Proc. IAAI, pp 838-843
    • (1999) Proc. IAAI , pp. 838-843
    • Abdennadher, S.1    Schlenker, H.2
  • 2
    • 9444233562 scopus 로고    scopus 로고
    • How to establish arc-consistency by reactive agents
    • BenHassine A, Ghédira K (2002) How to establish arc-consistency by reactive agents. In: Proc. ECAI, pp 156-160
    • (2002) Proc. ECAI , pp. 156-160
    • Benhassine, A.1    Ghédira, K.2
  • 5
    • 0344057203 scopus 로고
    • Diagnosing and solving over-determined constraint satisfaction problems
    • Brakker RR, Dikker F, Tempelman F, Wognum PM (1993) Diagnosing and solving over-determined constraint satisfaction problems. In: Proc. IJCAI, pp 276-281
    • (1993) Proc. IJCAI , pp. 276-281
    • Brakker, R.R.1    Dikker, F.2    Tempelman, F.3    Wognum, P.M.4
  • 6
    • 0022020346 scopus 로고
    • Distributed snapshots: Determining global states of distributed systems
    • Chandy KM, Lamport L (1985) Distributed snapshots: determining global states of distributed systems. TOCS 3(1): 63-75
    • (1985) TOCS , vol.3 , Issue.1 , pp. 63-75
    • Chandy, K.M.1    Lamport, L.2
  • 11
    • 2442436785 scopus 로고    scopus 로고
    • Multiagent meeting scheduling with preferences: Efficiency, solution quality and privacy loss
    • Franzin MS, Freuder EC, Rossi F, Wallace R (2004) Multiagent meeting scheduling with preferences: efficiency, solution quality and privacy loss. Computational Intelligence 20(2):264-286
    • (2004) Computational Intelligence , vol.20 , Issue.2 , pp. 264-286
    • Franzin, M.S.1    Freuder, E.C.2    Rossi, F.3    Wallace, R.4
  • 12
    • 0041547877 scopus 로고    scopus 로고
    • Multi-agent meeting scheduling: Preliminary experimental results
    • Garrido L, Sycara K (1996) Multi-agent meeting scheduling: preliminary experimental results. In: Proc. ICMAS, pp 95-102
    • (1996) Proc. ICMAS , pp. 95-102
    • Garrido, L.1    Sycara, K.2
  • 13
    • 0001720892 scopus 로고    scopus 로고
    • Theory and properties of selfish protocol for multi-agent meeting scheduling using fuzzy constraints
    • Luo X, Leung HF Lee JH-M (2000) Theory and properties of selfish protocol for multi-agent meeting scheduling using fuzzy constraints. In: Proc. ECAI, pp 373-377
    • (2000) Proc. ECAI , pp. 373-377
    • Luo, X.1    Leung, H.F.2    Lee, J.H.-M.3
  • 14
    • 49449120803 scopus 로고
    • Consistency in network of relations
    • Mackworth AK (1970) Consistency in network of relations. Artificial Intelligence 8:99-118
    • (1970) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.K.1
  • 15
    • 0016050041 scopus 로고
    • Networks of constraints: Fundamental properties and applications to picture processing
    • Montanari U (1974) Networks of constraints: fundamental properties and applications to picture processing. Information Sciences 7:95-132
    • (1974) Information Sciences , vol.7 , pp. 95-132
    • Montanari, U.1
  • 16
    • 0001058478 scopus 로고
    • Two-person cooperative games
    • Nash JF (1953) Two-person cooperative games. Econometrica 21:128-140
    • (1953) Econometrica , vol.21 , pp. 128-140
    • Nash, J.F.1
  • 17
    • 0002582645 scopus 로고
    • Valued constraint satisfaction problems: Hard and easy problems
    • Schiex T, Fargier H, Verfaillie G (1995) Valued constraint satisfaction problems: hard and easy problems. In: Proc. 14th IJCAI, pp 631-637
    • (1995) Proc. 14th IJCAI , pp. 631-637
    • Schiex, T.1    Fargier, H.2    Verfaillie, G.3
  • 19
    • 84880684281 scopus 로고    scopus 로고
    • The difference all-difference makes
    • Stergiou K, Walsh T (1999) The difference all-difference makes. In: Proc. IJCAI. pp 414-419
    • (1999) Proc. IJCAI. , pp. 414-419
    • Stergiou, K.1    Walsh, T.2
  • 22
    • 0038241293 scopus 로고    scopus 로고
    • Scheduling meetings using distributed valued constraint satisfaction algorithm
    • Tsuruta T, Shintani T (2000) Scheduling meetings using distributed valued constraint satisfaction algorithm. In: Proc. of ECAI, pp 383-387
    • (2000) Proc. of ECAI , pp. 383-387
    • Tsuruta, T.1    Shintani, T.2


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