Shigenobu Kobayashi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hajime Kita

> Home > Persons > Shigenobu Kobayashi

Publications

2001
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/IkedaKK01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/IkedaKK01
Kokolo Ikeda, Hajime Kita, Shigenobu Kobayashi:
Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal? CEC 2001: 957-962
2000
[c23]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/gecco/TakahashiKK00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gecco/TakahashiKK00
Osamu Takahashi, Hajime Kita, Shigenobu Kobayashi:
A Real-Coded Genetic Algorithm using Distance Dependent Alternation Model for Complex Function Optimization. GECCO 2000: 219-226
1999
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/KitaOK99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/KitaOK99
Hajime Kita, Isao Ono, Shigenobu Kobayashi:
Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms. CEC 1999: 1581-1588
1996
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icec/TamakiKK96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icec/TamakiKK96
Hisashi Tamaki, Hajime Kita, Shigenobu Kobayashi:
Multi-Objective Optimization by Genetic Algorithms: A Review. International Conference on Evolutionary Computation 1996: 517-522

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.