메뉴 건너뛰기




Volumn Proceedings of the 2008 IEEE International Conference on Cluster Computing, ICCC 2008, Issue , 2008, Pages 304-309

Load-balancing methods for parallel and distributed constraint solving

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCALABILITY;

EID: 57949105199     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2008.4663786     Document Type: Conference Paper
Times cited : (10)

References (13)
  • 2
    • 57349118422 scopus 로고    scopus 로고
    • San Francisco, CA, USA: Morgan Kaufmann Publishers Inc
    • R. Dechter, Constraint Processing. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2003.
    • (2003) Constraint Processing
    • Dechter, R.1
  • 3
    • 38149058322 scopus 로고    scopus 로고
    • L. Michel, A. See, and P. V. Hentenryck, Parallelizing constraint programs transparently, in CP, ser. Lecture Notes in Computer Science, C. Bessiere, Ed., 4741. Springer, 2007, pp. 514-528.
    • L. Michel, A. See, and P. V. Hentenryck, "Parallelizing constraint programs transparently," in CP, ser. Lecture Notes in Computer Science, C. Bessiere, Ed., vol. 4741. Springer, 2007, pp. 514-528.
  • 5
    • 0032649748 scopus 로고    scopus 로고
    • State of the art in parallel search techniques for discrete optimization problems
    • A. Grama and V. Kumar, "State of the art in parallel search techniques for discrete optimization problems," IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. 1, pp. 28-36, 1999.
    • (1999) IEEE Transactions on Knowledge & Data Engineering , vol.11 , Issue.1 , pp. 28-36
    • Grama, A.1    Kumar, V.2
  • 6
    • 0030146202 scopus 로고    scopus 로고
    • Parallel search in discrete optimization problems
    • A. Reinefeld, "Parallel search in discrete optimization problems," Simulation Practice and Theory, vol. 4, no. 2-3, pp. 169-188, 1996.
    • (1996) Simulation Practice and Theory , vol.4 , Issue.2-3 , pp. 169-188
    • Reinefeld, A.1
  • 11
    • 84880831475 scopus 로고    scopus 로고
    • A. López-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek, A fast and simple algorithm for bounds consistency of the alldifferent constraint, in IJCAI, G. Gottlob and T. Walsh, Eds. Morgan Kaufmann, 2003, pp. 245-250.
    • A. López-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek, "A fast and simple algorithm for bounds consistency of the alldifferent constraint," in IJCAI, G. Gottlob and T. Walsh, Eds. Morgan Kaufmann, 2003, pp. 245-250.
  • 12
    • 0031624252 scopus 로고    scopus 로고
    • A fast algorithm for the bound consistency of alldiff constraints
    • J.-F. Puget, "A fast algorithm for the bound consistency of alldiff constraints," in AAAI/IAAI, 1998, pp. 359-366.
    • (1998) AAAI/IAAI , pp. 359-366
    • Puget, J.-F.1
  • 13
    • 33745348779 scopus 로고    scopus 로고
    • When do bounds and domain propagation lead to the same search space?
    • C. Schulte and P. J. Stuckey, "When do bounds and domain propagation lead to the same search space?" ACM Trans. Program. Lang. Syst., vol. 27, no. 3, pp. 388-425, 2005.
    • (2005) ACM Trans. Program. Lang. Syst , vol.27 , Issue.3 , pp. 388-425
    • Schulte, C.1    Stuckey, P.J.2


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