Haym Hirsh

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 Khaled Rasheed

> Home > Persons > Haym Hirsh

Publications

2000
[c35]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/gecco/RasheedH00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gecco/RasheedH00
Khaled Rasheed, Haym Hirsh:
Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models. GECCO 2000: 628-635
1999
[j11]
- view
  - electronic edition @ cambridge.org
  - no references & citations available
- export record
  dblp key:
  - journals/aiedam/RasheedH99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aiedam/RasheedH99
Khaled Rasheed, Haym Hirsh:
Learning to be selective in genetic-algorithm-based design optimization. Artif. Intell. Eng. Des. Anal. Manuf. 13(3): 157-169 (1999)
1997
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/aei/RasheedHG97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aei/RasheedHG97
Khaled Rasheed, Haym Hirsh, Andrew Gelsey:
A genetic algorithm for continuous design space search. Artif. Intell. Eng. 11(3): 295-305 (1997)
[c20]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/icga/RasheedH97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icga/RasheedH97
Khaled Rasheed, Haym Hirsh:
Using Case Based Learning to Improve Genetic Algorithm Based Design Optimization. ICGA 1997: 513-520

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.