메뉴 건너뛰기




Volumn 161, Issue 1-2, 2005, Pages 181-208

Open constraint programming

Author keywords

Constraint satisfaction; Distributed AI; Multi agent systems

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; INTERNET; MULTI AGENT SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

EID: 10044279569     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.10.005     Document Type: Article
Times cited : (60)

References (29)
  • 1
    • 0001784206 scopus 로고
    • On the equivalence of constraint satisfaction problems
    • F. Rossi, C. Petrie, V. Dhar, On the equivalence of constraint satisfaction problems, in: Proceedings of ECAI 90, 1990, pp. 550-556.
    • (1990) Proceedings of ECAI , vol.90 , pp. 550-556
    • Rossi, F.1    Petrie, C.2    Dhar, V.3
  • 2
    • 0032596636 scopus 로고    scopus 로고
    • Encodings of non-binary constraint satisfaction problems
    • Orlando, FL, AAAI Press
    • K. Stergiou, T. Walsh, Encodings of non-binary constraint satisfaction problems, in: Proceedings of AAAI-99, Orlando, FL, AAAI Press, 1999, pp. 163-168.
    • (1999) Proceedings of AAAI-99 , pp. 163-168
    • Stergiou, K.1    Walsh, T.2
  • 3
    • 84947944781 scopus 로고    scopus 로고
    • Solving non-binary CSPs using the hidden variable encoding
    • Lecture Notes in Computer Science, Springer, Berlin
    • N. Mamoulis, K. Stergiou, Solving non-binary CSPs using the hidden variable encoding, in: Proceedings of CP 2001, in: Lecture Notes in Computer Science, vol. 2239, Springer, Berlin, 2001, pp. 168-182.
    • (2001) Proceedings of CP 2001 , vol.2239 , pp. 168-182
    • Mamoulis, N.1    Stergiou, K.2
  • 6
    • 0002813111 scopus 로고    scopus 로고
    • Agent-based semantic interoperability in InfoSleuth
    • J. Fowler, B. Perry, M. Nodine, B. Bargmeyer, Agent-based semantic interoperability in InfoSleuth, SIGMOD Record 28 (1) (1999) 60-67.
    • (1999) SIGMOD Record , vol.28 , Issue.1 , pp. 60-67
    • Fowler, J.1    Perry, B.2    Nodine, M.3    Bargmeyer, B.4
  • 8
    • 0031095278 scopus 로고    scopus 로고
    • Semiring-based constraint solving and optimization
    • S. Bistarelli, U. Montanari, F. Rossi, Semiring-based constraint solving and optimization, J. ACM 44 (1997) 201-236.
    • (1997) J. ACM , vol.44 , pp. 201-236
    • Bistarelli, S.1    Montanari, U.2    Rossi, F.3
  • 12
    • 84880664199 scopus 로고    scopus 로고
    • Constraint propagation and value acquisition: Why we should do it interactively
    • Stockholm, Sweden, Morgan Kaufmann, San Mateo, CA
    • R. Cucchiara, M. Gavanelli, E. Lamma, P. Mello, M. Milano, M. Piccardi, Constraint propagation and value acquisition: why we should do it interactively, in: Proceedings IJCAI-99, Stockholm, Sweden, Morgan Kaufmann, San Mateo, CA, 1999, pp. 468-477.
    • (1999) Proceedings IJCAI-99 , pp. 468-477
    • Cucchiara, R.1    Gavanelli, M.2    Lamma, E.3    Mello, P.4    Milano, M.5    Piccardi, M.6
  • 14
    • 0032158242 scopus 로고    scopus 로고
    • A classification and constraint-based frame-work for configuration
    • D. Mailharro, A classification and constraint-based frame-work for configuration, AI in Engineering, Design and Manucturing 12 (1998) 383-397.
    • (1998) AI in Engineering, Design and Manucturing , vol.12 , pp. 383-397
    • Mailharro, D.1
  • 15
    • 77952492430 scopus 로고
    • Arc-consistency in dynamic constraint satisfaction problems
    • Anaheim, CA
    • C. Bessière, Arc-consistency in dynamic constraint satisfaction problems, in: Proceedings of AAAI-91, Anaheim, CA, 1991, pp. 221-226.
    • (1991) Proceedings of AAAI-91 , pp. 221-226
    • Bessière, C.1
  • 16
    • 0002818660 scopus 로고
    • Asynchronous weak-commitment search for solving large-scale distributed constraint satisfaction problems
    • MIT Press, Cambridge, MA
    • M.-Yokoo, Asynchronous weak-commitment search for solving large-scale distributed constraint satisfaction problems, in: Proceedings of the First International Conference on Multi-Agent Systems, MIT Press, Cambridge, MA, 1995, p. 467.
    • (1995) Proceedings of the First International Conference on Multi-agent Systems , pp. 467
    • Yokoo, M.1
  • 21
    • 0034172516 scopus 로고    scopus 로고
    • Flexible and scalable cost-based query planning in mediators: A transformational approach
    • J.L. Ambite, C. Knoblock, Flexible and scalable cost-based query planning in mediators: a transformational approach, Artificial Intelligence 118 (2000) 115-161.
    • (2000) Artificial Intelligence , vol.118 , pp. 115-161
    • Ambite, J.L.1    Knoblock, C.2
  • 25
    • 0036461033 scopus 로고    scopus 로고
    • Supporting online resource discovery in the context of ongoing tasks with proactive assistants
    • J. Budzik, S. Bradshaw, X. Fu, K. Hammond, Supporting online resource discovery in the context of ongoing tasks with proactive assistants, Internat. J. Human-Computer Stud. 56 (1) (2002) 47-74.
    • (2002) Internat. J. Human-computer Stud. , vol.56 , Issue.1 , pp. 47-74
    • Budzik, J.1    Bradshaw, S.2    Fu, X.3    Hammond, K.4
  • 26
    • 0034499162 scopus 로고    scopus 로고
    • Just-in-time information retrieval agents
    • B.J. Rhodes, P. Maes, Just-in-time information retrieval agents, IBM Systems J. 39 (2000) 685-704.
    • (2000) IBM Systems J. , vol.39 , pp. 685-704
    • Rhodes, B.J.1    Maes, P.2
  • 28
    • 0036932447 scopus 로고    scopus 로고
    • Partial-revelation VCG mechanism for combinatorial auctions
    • Edmonton, AB
    • W. Conen, T. Sandholm, Partial-revelation VCG mechanism for combinatorial auctions, in: Proceedings of AAAI-02, Edmonton, AB, 2002, pp. 367-372.
    • (2002) Proceedings of AAAI-02 , pp. 367-372
    • Conen, W.1    Sandholm, T.2
  • 29
    • 0022129301 scopus 로고
    • Depth-first iterative deepening: An optimal admissible tree search
    • R.E. Korf, Depth-first iterative deepening: an optimal admissible tree search, Artificial Intelligence 27 (1) (1985) 97-109.
    • (1985) Artificial Intelligence , vol.27 , Issue.1 , pp. 97-109
    • Korf, R.E.1


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