Publications
Detailed Information
Effective genetic algorithms for combinatorial optimization : Analytical and empirical approaches : 조합 최적화를 위한 효과적인 유전 알고리즘
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 문병로 | - |
| dc.contributor.author | 최성순 | - |
| dc.date.accessioned | 2010-02-02T16:10:38Z | - |
| dc.date.available | 2010-02-02T16:10:38Z | - |
| dc.date.copyright | 2006 | - |
| dc.date.issued | 2006 | - |
| dc.identifier.other | 000000048764 | - |
| dc.identifier.uri | http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000048764 | - |
| dc.description | Thesis(doctor`s)--서울대학교 대학원 :전기·컴퓨터공학부,2006. | - |
| dc.format.extent | vii, 129 leaves | - |
| dc.language.iso | en | - |
| dc.publisher | 서울대학교 대학원 | - |
| dc.subject | 유전 알고리즘 | - |
| dc.subject | Genetic algorithms | - |
| dc.subject | 조합 최적화 | - |
| dc.subject | combinatorial optimization | - |
| dc.subject | 정규화 | - |
| dc.subject | normalization | - |
| dc.subject | 문제 공간 분석 | - |
| dc.subject | search space analysis | - |
| dc.subject | 정렬망 문제 | - |
| dc.subject | sorting network problem | - |
| dc.subject | 생존 확률 | - |
| dc.subject | survival probability | - |
| dc.subject | 상위 | - |
| dc.subject | epistasis | - |
| dc.subject | 블랙 박스 시나리오 | - |
| dc.subject | black box scenario | - |
| dc.subject | 월시 변환 | - |
| dc.subject | Walsh analysis | - |
| dc.title | Effective genetic algorithms for combinatorial optimization : Analytical and empirical approaches | - |
| dc.title.alternative | 조합 최적화를 위한 효과적인 유전 알고리즘 | - |
| dc.type | Thesis | - |
| dc.contributor.department | 전기·컴퓨터공학부 | - |
| dc.description.degree | Thesis(doctor`s)-- | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.