Harmony search (HS) is a metaheuristic algorithm mimicking the improvisation process of musicians. In the process, each musician (= decision variable) plays (= generates) a note (= value) for finding a best harmony (= global optimum) all together. The Harmony Search algorithm has a novel stochastic derivative (for discrete variable) based on musician's experience, rather than gradient (for continuous variable) in differential calculus.
| Property | Value |
| dbpprop:abstract
|
- Harmony search (HS) is a metaheuristic algorithm mimicking the improvisation process of musicians. In the process, each musician (= decision variable) plays (= generates) a note (= value) for finding a best harmony (= global optimum) all together. The Harmony Search algorithm has a novel stochastic derivative (for discrete variable) based on musician's experience, rather than gradient (for continuous variable) in differential calculus.
|
| dbpprop:hasPhotoCollection
| |
| dbpprop:reference
| |
| rdf:type
| |
| rdfs:comment
|
- Harmony search (HS) is a metaheuristic algorithm mimicking the improvisation process of musicians. In the process, each musician (= decision variable) plays (= generates) a note (= value) for finding a best harmony (= global optimum) all together. The Harmony Search algorithm has a novel stochastic derivative (for discrete variable) based on musician's experience, rather than gradient (for continuous variable) in differential calculus.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:disambiguates
of | |
| is dbpprop:redirect
of | |
| is owl:sameAs
of | |