메뉴 건너뛰기




Volumn 2723, Issue , 2003, Pages 991-1002

Hybridization of estimation of distribution algorithms with a repair method for solving constraint satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; CONSTRAINT SATISFACTION PROBLEMS; REPAIR;

EID: 35248844201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_110     Document Type: Article
Times cited : (6)

References (21)
  • 4
    • 0002373085 scopus 로고
    • How to Apply Genetic Algorithms to Constrained Problems
    • Lance Chambers Editors, CRC Press, Chapter 10
    • A. E. Eiben et al.: How to Apply Genetic Algorithms to Constrained Problems, Practical Handbook of Genetic Algorithms, Lance Chambers Editors, CRC Press, Chapter 10 (1995) 307-365
    • (1995) Practical Handbook of Genetic Algorithms , pp. 307-365
    • Eiben, A.E.1
  • 8
    • 0032035547 scopus 로고    scopus 로고
    • Solving constraint satisfaction problems using hybrid evolutionary search
    • G. Dozier et al.: Solving constraint satisfaction problems using hybrid evolutionary search, IEEE Transactions on Evolutionary Computation 2(1) (1998) 23-33
    • (1998) IEEE Transactions on Evolutionary Computation , vol.2 , Issue.1 , pp. 23-33
    • Dozier, G.1
  • 9
    • 0033329378 scopus 로고    scopus 로고
    • Coevolutionary Genetic Algorithm for Constraint Satisfaction with a Genetic Repair Operator for Effective Schemata Formation
    • H. Handa et al.: Coevolutionary Genetic Algorithm for Constraint Satisfaction with a Genetic Repair Operator for Effective Schemata Formation, Proceedings of the 1999 IEEE System Man and Cybernetics Conference III (1999) 617-621
    • (1999) Proceedings of the 1999 IEEE System Man and Cybernetics Conference , vol.3 , pp. 617-621
    • Handa, H.1
  • 10
    • 0039340390 scopus 로고
    • Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
    • E. C. Freuder and A. K. Mackworth Editors, The MIT Press
    • S. Minton et al.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Constraint-Based Reasoning, E. C. Freuder and A. K. Mackworth Editors, The MIT Press (1994) 161-206,
    • (1994) Constraint-Based Reasoning , pp. 161-206
    • Minton, S.1
  • 11
    • 84958959530 scopus 로고    scopus 로고
    • From Recombination of genes to the estimation of distributions I. Binary parameters
    • H. Mühlenbein and G. Paaß:From Recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature - PPSN IV (1996) 178-187
    • (1996) Parallel Problem Solving from Nature - PPSN IV , pp. 178-187
    • Mühlenbein, H.1    Paaß, G.2
  • 12
    • 0041481252 scopus 로고    scopus 로고
    • P. Larrañaga and J. A. Lozano Editors: Kluwer Academic Publishers
    • P. Larrañaga and J. A. Lozano Editors: Estimation of Distribution Algorithms, Kluwer Academic Publishers (2002)
    • (2002) Estimation of Distribution Algorithms
  • 14
    • 0011801192 scopus 로고    scopus 로고
    • Ph.D. thesis, University of Illinois at Urbana-Champaign, Urbana, IL. Also IlliGAL Report No. 2002023
    • M. Pelikan: Bayesian optimization algorithm: From single level to hierarchy, Ph.D. thesis, University of Illinois at Urbana-Champaign, Urbana, IL. Also IlliGAL Report No. 2002023 (2002)
    • (2002) Bayesian Optimization Algorithm: From Single Level to Hierarchy
    • Pelikan, M.1
  • 16
    • 0033258156 scopus 로고    scopus 로고
    • FDA - A scalable evolutionary algorithms for the optimization of additively decomposed functions
    • H. Mühlenbein and T. Mahnig: FDA - a scalable evolutionary algorithms for the optimization of additively decomposed functions, Evolutionary Computation 7(4) (1999) 353-376
    • (1999) Evolutionary Computation , vol.7 , Issue.4 , pp. 353-376
    • Mühlenbein, H.1    Mahnig, T.2
  • 18
    • 0036859018 scopus 로고    scopus 로고
    • Using a priori knowledge to create probabilistic models for optimization
    • S. Baluja: Using a priori knowledge to create probabilistic models for optimization International J. of Approximate Reasoning, 31(3) (2002) 193-220
    • (2002) International J. of Approximate Reasoning , vol.31 , Issue.3 , pp. 193-220
    • Baluja, S.1
  • 20
    • 0036887533 scopus 로고    scopus 로고
    • Learning and simulation of Bayesian networks applied to inexact graph matching
    • E. Bengoetxea et al.: Learning and simulation of Bayesian networks applied to inexact graph matching, Pattern Recognition, 35(12) (2002) 2867-2880
    • (2002) Pattern Recognition , vol.35 , Issue.12 , pp. 2867-2880
    • Bengoetxea, E.1
  • 21
    • 0001842954 scopus 로고
    • A Study of Reproduction in Generational and Steady-State Genetic Algorithms
    • G. J. E. Rawlins Editors, Morgan Kaufman
    • G. Syswerda: A Study of Reproduction in Generational and Steady-State Genetic Algorithms, Foundations of Genetic Algorithms, G. J. E. Rawlins Editors, Morgan Kaufman (1990) 94-101
    • (1990) Foundations of Genetic Algorithms , pp. 94-101
    • Syswerda, G.1


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