Остановите войну!
for scientists:
default search action
Thomas Stützle
- > Home > Persons > Thomas Stützle
Publications
- 2015
- [j70]Tianjun Liao, Daniel Molina, Thomas Stützle:
Performance evaluation of automatically tuned continuous optimizers on different benchmark sets. Appl. Soft Comput. 27: 490-503 (2015) - 2014
- [j61]Tianjun Liao, Daniel Molina, Marco Antonio Montes de Oca, Thomas Stützle:
A Note on Bound Constraints Handling for the IEEE CEC'05 Benchmark Function Suite. Evol. Comput. 22(2): 351-359 (2014) - [j60]Tianjun Liao, Thomas Stützle, Marco Antonio Montes de Oca, Marco Dorigo:
A unified ant colony optimization algorithm for continuous optimization. Eur. J. Oper. Res. 234(3): 597-609 (2014) - [j55]Tianjun Liao, Krzysztof Socha, Marco Antonio Montes de Oca, Thomas Stützle, Marco Dorigo:
Ant Colony Optimization for Mixed-Variable Optimization Problems. IEEE Trans. Evol. Comput. 18(4): 503-518 (2014) - 2013
- [j52]Tianjun Liao, Marco Antonio Montes de Oca, Thomas Stützle:
Computational results for an automatically tuned CMA-ES with increasing population size on the CEC'05 benchmark set. Soft Comput. 17(6): 1031-1046 (2013) - [j50]Tianjun Liao, Dogan Aydin, Thomas Stützle:
Artificial bee colonies for continuous optimization: Experimental analysis and improvements. Swarm Intell. 7(4): 327-356 (2013) - [c83]Tianjun Liao, Thomas Stützle:
Benchmark results for a simple hybrid algorithm on the CEC 2013 benchmark set for real-parameter optimization. IEEE Congress on Evolutionary Computation 2013: 1938-1944 - [c79]Tianjun Liao, Thomas Stützle:
Bounding the population size of IPOP-CMA-ES on the noiseless BBOB testbed. GECCO (Companion) 2013: 1161-1168 - [c78]Tianjun Liao, Thomas Stützle:
Testing the impact of parameter tuning on a variant of IPOP-CMA-ES with a bounded maximum population size on the noiseless BBOB testbed. GECCO (Companion) 2013: 1169-1176 - [c77]Tianjun Liao, Thomas Stützle:
Expensive optimization scenario: IPOP-CMA-ES with a population bound mechanism for noiseless function testbed. GECCO (Companion) 2013: 1185-1192 - 2012
- [c69]Tianjun Liao, Daniel Molina, Thomas Stützle, Marco Antonio Montes de Oca, Marco Dorigo:
An ACO algorithm benchmarked on the BBOB noiseless function testbed. GECCO (Companion) 2012: 159-166 - [c67]Manuel López-Ibáñez, Tianjun Liao, Thomas Stützle:
On the Anytime Behavior of IPOP-CMA-ES. PPSN (1) 2012: 357-366 - 2011
- [c66]Dogan Aydin, Tianjun Liao, Marco Antonio Montes de Oca, Thomas Stützle:
Improving Performance via Population Growth and Local Search: The Case of the Artificial Bee Colony Algorithm. Artificial Evolution 2011: 85-96 - [c61]Tianjun Liao, Marco Antonio Montes de Oca, Dogan Aydin, Thomas Stützle, Marco Dorigo:
An incremental ant colony algorithm with local search for continuous optimization. GECCO 2011: 125-132 - [c60]Tianjun Liao, Marco Antonio Montes de Oca, Thomas Stützle:
Tuning parameters across mixed dimensional instances: a performance scalability study of Sep-G-CMA-ES. GECCO (Companion) 2011: 703-706
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 23:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint