Lanean...
Tunably Rugged Landscapes With Known Maximum and Minimum
We propose NM landscapes as a new class of tunably rugged benchmark problems. NM landscapes are well defined on alphabets of any arity, including both discrete and real-valued alphabets, include epistasis in a natural and transparent manner, are proven to have known value and location of the global...
Gorde:
| Argitaratua izan da: | IEEE Trans Evol Comput |
|---|---|
| Egile Nagusiak: | , , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
2015
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5553988/ https://ncbi.nlm.nih.gov/pubmed/28804241 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/TEVC.2015.2454857 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|