메뉴 건너뛰기




Volumn 1118, Issue , 1996, Pages 338-352

Towards a more efficient stochastic constraint solver

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84957867092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_85     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 8
    • 44049112032 scopus 로고
    • Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
    • S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992.
    • (1992) Artificial Intelligence , vol.58 , pp. 161-205
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3    Laird, P.4
  • 11
    • 0003634336 scopus 로고
    • Tackling car sequencing problems using a generic genetic algorithm
    • (to appear).
    • T. Warwick and E.P.K. Tsang. Tackling car sequencing problems using a generic genetic algorithm. Evolutionary Computation, 3(3):267-298, 1995. (to appear).
    • (1995) Evolutionary Computation , vol.3 , Issue.3 , pp. 267-298
    • Warwick, T.1    Tsang, E.P.K.2


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