---
_id: '16407'
abstract:
- lang: eng
text: "Many virtual 3D scenes, especially those that are large, are not structured
evenly. For such heterogeneous data, there is no single algorithm that is able
to render every scene type at each position fast and with the same high image
quality. For a small set of scenes, this situation can be improved if different
rendering algorithms are manually assigned to particular parts of the scene by
an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically
deploys different rendering algorithms simultaneously for a broad range of scene
types. The method divides the scene into subregions and measures the behavior
of different algorithms for each region in a preprocessing step. During runtime,
this data is utilized to compute an estimate for the quality and running time
of the available rendering algorithms from the observer's point of view. By solving
an optimizing problem, the image quality can be optimized by an assignment of
algorithms to regions while keeping the frame rate almost constant.\r\n"
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D
Rendering of Heterogeneous Scenes. In: Advances in Visual Computing. Berlin,
Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_44'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual
Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_44
bibtex: '@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin,
Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={10.1007/978-3-642-41914-0_44},
booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin
and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
year={2013} }'
chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In Advances
in Visual Computing. Berlin, Heidelberg, 2013. https://doi.org/10.1007/978-3-642-41914-0_44.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time
3D Rendering of Heterogeneous Scenes,” in Advances in Visual Computing,
Berlin, Heidelberg, 2013.
mla: Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” Advances
in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.
short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:38:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_44
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642419133'
- '9783642419140'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Real-Time 3D Rendering of Heterogeneous Scenes
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '13115'
author:
- first_name: G.
full_name: Szarvas, G.
last_name: Szarvas
- first_name: Robert
full_name: Busa-Fekete, Robert
last_name: Busa-Fekete
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Szarvas G, Busa-Fekete R, Hüllermeier E. Learning to rank lexical substitutions.
In: In Proceedings EMNLP-2013 Conference on Empirical Methods in Natural Language
Processing, Seattle, USA. ; 2013.'
apa: Szarvas, G., Busa-Fekete, R., & Hüllermeier, E. (2013). Learning to rank
lexical substitutions. In In Proceedings EMNLP-2013 Conference on Empirical
Methods in Natural Language Processing, Seattle, USA.
bibtex: '@inproceedings{Szarvas_Busa-Fekete_Hüllermeier_2013, title={Learning to
rank lexical substitutions}, booktitle={In Proceedings EMNLP-2013 Conference on
Empirical Methods in Natural Language Processing, Seattle, USA}, author={Szarvas,
G. and Busa-Fekete, Robert and Hüllermeier, Eyke}, year={2013} }'
chicago: Szarvas, G., Robert Busa-Fekete, and Eyke Hüllermeier. “Learning to Rank
Lexical Substitutions.” In In Proceedings EMNLP-2013 Conference on Empirical
Methods in Natural Language Processing, Seattle, USA, 2013.
ieee: G. Szarvas, R. Busa-Fekete, and E. Hüllermeier, “Learning to rank lexical
substitutions,” in In Proceedings EMNLP-2013 Conference on Empirical Methods
in Natural Language Processing, Seattle, USA, 2013.
mla: Szarvas, G., et al. “Learning to Rank Lexical Substitutions.” In Proceedings
EMNLP-2013 Conference on Empirical Methods in Natural Language Processing, Seattle,
USA, 2013.
short: 'G. Szarvas, R. Busa-Fekete, E. Hüllermeier, in: In Proceedings EMNLP-2013
Conference on Empirical Methods in Natural Language Processing, Seattle, USA,
2013.'
date_created: 2019-08-30T15:24:59Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
publication: In Proceedings EMNLP-2013 Conference on Empirical Methods in Natural
Language Processing, Seattle, USA
status: public
title: Learning to rank lexical substitutions
type: conference
user_id: '49109'
year: '2013'
...
---
_id: '13116'
author:
- first_name: K.
full_name: Dembczynski, K.
last_name: Dembczynski
- first_name: A.
full_name: Jachnik, A.
last_name: Jachnik
- first_name: W.
full_name: Kotlowski, W.
last_name: Kotlowski
- first_name: W.
full_name: Waegeman, W.
last_name: Waegeman
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Dembczynski K, Jachnik A, Kotlowski W, Waegeman W, Hüllermeier E. Optimizing
the F-measure in multi-label classification: Plug-in rule approach versus structured
loss minimization. In: Dasgupta S, McAllester D, eds. In Proceedings ICML-2013,
30th International Conference on Machine Learning, Atlanta, USA. ; 2013:1130-1138.'
apa: 'Dembczynski, K., Jachnik, A., Kotlowski, W., Waegeman, W., & Hüllermeier,
E. (2013). Optimizing the F-measure in multi-label classification: Plug-in rule
approach versus structured loss minimization. In S. Dasgupta & D. McAllester
(Eds.), in Proceedings ICML-2013, 30th International Conference on Machine
Learning, Atlanta, USA (pp. 1130–1138).'
bibtex: '@inproceedings{Dembczynski_Jachnik_Kotlowski_Waegeman_Hüllermeier_2013,
title={Optimizing the F-measure in multi-label classification: Plug-in rule approach
versus structured loss minimization}, booktitle={in Proceedings ICML-2013, 30th
International Conference on Machine Learning, Atlanta, USA}, author={Dembczynski,
K. and Jachnik, A. and Kotlowski, W. and Waegeman, W. and Hüllermeier, Eyke},
editor={Dasgupta, S. and McAllester, D.Editors}, year={2013}, pages={1130–1138}
}'
chicago: 'Dembczynski, K., A. Jachnik, W. Kotlowski, W. Waegeman, and Eyke Hüllermeier.
“Optimizing the F-Measure in Multi-Label Classification: Plug-in Rule Approach
versus Structured Loss Minimization.” In In Proceedings ICML-2013, 30th International
Conference on Machine Learning, Atlanta, USA, edited by S. Dasgupta and D.
McAllester, 1130–38, 2013.'
ieee: 'K. Dembczynski, A. Jachnik, W. Kotlowski, W. Waegeman, and E. Hüllermeier,
“Optimizing the F-measure in multi-label classification: Plug-in rule approach
versus structured loss minimization,” in in Proceedings ICML-2013, 30th International
Conference on Machine Learning, Atlanta, USA, 2013, pp. 1130–1138.'
mla: 'Dembczynski, K., et al. “Optimizing the F-Measure in Multi-Label Classification:
Plug-in Rule Approach versus Structured Loss Minimization.” In Proceedings
ICML-2013, 30th International Conference on Machine Learning, Atlanta, USA,
edited by S. Dasgupta and D. McAllester, 2013, pp. 1130–38.'
short: 'K. Dembczynski, A. Jachnik, W. Kotlowski, W. Waegeman, E. Hüllermeier, in:
S. Dasgupta, D. McAllester (Eds.), In Proceedings ICML-2013, 30th International
Conference on Machine Learning, Atlanta, USA, 2013, pp. 1130–1138.'
date_created: 2019-08-30T15:33:19Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: S.
full_name: Dasgupta, S.
last_name: Dasgupta
- first_name: D.
full_name: McAllester, D.
last_name: McAllester
language:
- iso: eng
page: 1130-1138
publication: in Proceedings ICML-2013, 30th International Conference on Machine Learning,
Atlanta, USA
status: public
title: 'Optimizing the F-measure in multi-label classification: Plug-in rule approach
versus structured loss minimization'
type: conference
user_id: '49109'
year: '2013'
...
---
_id: '13117'
author:
- first_name: Robert
full_name: Busa-Fekete, Robert
last_name: Busa-Fekete
- first_name: B.
full_name: Szoreny, B.
last_name: Szoreny
- first_name: P.
full_name: Weng, P.
last_name: Weng
- first_name: W.
full_name: Cheng, W.
last_name: Cheng
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Busa-Fekete R, Szoreny B, Weng P, Cheng W, Hüllermeier E. Top-k selection
based on adaptive sampling of noisy preferences. In: Dasgupta S, McAllester D,
eds. In Proceedings ICML-2013, 30th International Conference on Machine Learning,
Atlanta, USA. ; 2013:1094-1102.'
apa: Busa-Fekete, R., Szoreny, B., Weng, P., Cheng, W., & Hüllermeier, E. (2013).
Top-k selection based on adaptive sampling of noisy preferences. In S. Dasgupta
& D. McAllester (Eds.), in Proceedings ICML-2013, 30th International Conference
on Machine Learning, Atlanta, USA (pp. 1094–1102).
bibtex: '@inproceedings{Busa-Fekete_Szoreny_Weng_Cheng_Hüllermeier_2013, title={Top-k
selection based on adaptive sampling of noisy preferences}, booktitle={in Proceedings
ICML-2013, 30th International Conference on Machine Learning, Atlanta, USA}, author={Busa-Fekete,
Robert and Szoreny, B. and Weng, P. and Cheng, W. and Hüllermeier, Eyke}, editor={Dasgupta,
S. and McAllester, D.Editors}, year={2013}, pages={1094–1102} }'
chicago: Busa-Fekete, Robert, B. Szoreny, P. Weng, W. Cheng, and Eyke Hüllermeier.
“Top-k Selection Based on Adaptive Sampling of Noisy Preferences.” In In Proceedings
ICML-2013, 30th International Conference on Machine Learning, Atlanta, USA,
edited by S. Dasgupta and D. McAllester, 1094–1102, 2013.
ieee: R. Busa-Fekete, B. Szoreny, P. Weng, W. Cheng, and E. Hüllermeier, “Top-k
selection based on adaptive sampling of noisy preferences,” in in Proceedings
ICML-2013, 30th International Conference on Machine Learning, Atlanta, USA,
2013, pp. 1094–1102.
mla: Busa-Fekete, Robert, et al. “Top-k Selection Based on Adaptive Sampling of
Noisy Preferences.” In Proceedings ICML-2013, 30th International Conference
on Machine Learning, Atlanta, USA, edited by S. Dasgupta and D. McAllester,
2013, pp. 1094–102.
short: 'R. Busa-Fekete, B. Szoreny, P. Weng, W. Cheng, E. Hüllermeier, in: S. Dasgupta,
D. McAllester (Eds.), In Proceedings ICML-2013, 30th International Conference
on Machine Learning, Atlanta, USA, 2013, pp. 1094–1102.'
date_created: 2019-08-30T15:38:31Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: S.
full_name: Dasgupta, S.
last_name: Dasgupta
- first_name: D.
full_name: McAllester, D.
last_name: McAllester
language:
- iso: eng
page: 1094-1102
publication: in Proceedings ICML-2013, 30th International Conference on Machine Learning,
Atlanta, USA
status: public
title: Top-k selection based on adaptive sampling of noisy preferences
type: conference
user_id: '49109'
year: '2013'
...
---
_id: '13118'
author:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: W.
full_name: Cheng, W.
last_name: Cheng
citation:
ama: 'Hüllermeier E, Cheng W. Preference-based CBR: General ideas and basic principles.
In: Rossi F, ed. In Proceedings IJCAI-13, 23rd International Joint Conference
on Artificial Intelligence, Beijing, China. AAAI Press; 2013:3012-3016.'
apa: 'Hüllermeier, E., & Cheng, W. (2013). Preference-based CBR: General ideas
and basic principles. In F. Rossi (Ed.), in Proceedings IJCAI-13, 23rd international
Joint Conference on Artificial Intelligence, Beijing, China (pp. 3012–3016).
AAAI Press.'
bibtex: '@inproceedings{Hüllermeier_Cheng_2013, title={Preference-based CBR: General
ideas and basic principles}, booktitle={in Proceedings IJCAI-13, 23rd international
Joint Conference on Artificial Intelligence, Beijing, China}, publisher={AAAI
Press}, author={Hüllermeier, Eyke and Cheng, W.}, editor={Rossi, F.Editor}, year={2013},
pages={3012–3016} }'
chicago: 'Hüllermeier, Eyke, and W. Cheng. “Preference-Based CBR: General Ideas
and Basic Principles.” In In Proceedings IJCAI-13, 23rd International Joint
Conference on Artificial Intelligence, Beijing, China, edited by F. Rossi,
3012–16. AAAI Press, 2013.'
ieee: 'E. Hüllermeier and W. Cheng, “Preference-based CBR: General ideas and basic
principles,” in in Proceedings IJCAI-13, 23rd international Joint Conference
on Artificial Intelligence, Beijing, China, 2013, pp. 3012–3016.'
mla: 'Hüllermeier, Eyke, and W. Cheng. “Preference-Based CBR: General Ideas and
Basic Principles.” In Proceedings IJCAI-13, 23rd International Joint Conference
on Artificial Intelligence, Beijing, China, edited by F. Rossi, AAAI Press,
2013, pp. 3012–16.'
short: 'E. Hüllermeier, W. Cheng, in: F. Rossi (Ed.), In Proceedings IJCAI-13, 23rd
International Joint Conference on Artificial Intelligence, Beijing, China, AAAI
Press, 2013, pp. 3012–3016.'
date_created: 2019-08-30T15:44:03Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: F.
full_name: Rossi, F.
last_name: Rossi
language:
- iso: eng
page: 3012-3016
publication: in Proceedings IJCAI-13, 23rd international Joint Conference on Artificial
Intelligence, Beijing, China
publisher: AAAI Press
status: public
title: 'Preference-based CBR: General ideas and basic principles'
type: conference
user_id: '49109'
year: '2013'
...
---
_id: '13119'
author:
- first_name: Sascha
full_name: Henzgen, Sascha
last_name: Henzgen
- first_name: M.
full_name: Strickert, M.
last_name: Strickert
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Henzgen S, Strickert M, Hüllermeier E. Rule chains for visualizing evolving
fuzzy rule-based systems. In: Burduk R, Jackowski K, Kurzynski M, Wozniak M, Zolnierek
A, eds. In Proceedings CORES 2013, 8th International Conference on Computer
Recognition Systems, Wroclaw, Poland. Springer; 2013:279-288.'
apa: Henzgen, S., Strickert, M., & Hüllermeier, E. (2013). Rule chains for visualizing
evolving fuzzy rule-based systems. In R. Burduk, K. Jackowski, M. Kurzynski, M.
Wozniak, & A. Zolnierek (Eds.), in Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland (pp. 279–288).
Springer.
bibtex: '@inproceedings{Henzgen_Strickert_Hüllermeier_2013, title={Rule chains for
visualizing evolving fuzzy rule-based systems}, booktitle={in Proceedings CORES
2013, 8th International Conference on Computer Recognition Systems, Wroclaw, Poland},
publisher={Springer}, author={Henzgen, Sascha and Strickert, M. and Hüllermeier,
Eyke}, editor={Burduk, R. and Jackowski, K. and Kurzynski, M. and Wozniak, M.
and Zolnierek, A.Editors}, year={2013}, pages={279–288} }'
chicago: Henzgen, Sascha, M. Strickert, and Eyke Hüllermeier. “Rule Chains for Visualizing
Evolving Fuzzy Rule-Based Systems.” In In Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland, edited by R.
Burduk, K. Jackowski, M. Kurzynski, M. Wozniak, and A. Zolnierek, 279–88. Springer,
2013.
ieee: S. Henzgen, M. Strickert, and E. Hüllermeier, “Rule chains for visualizing
evolving fuzzy rule-based systems,” in in Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland, 2013, pp. 279–288.
mla: Henzgen, Sascha, et al. “Rule Chains for Visualizing Evolving Fuzzy Rule-Based
Systems.” In Proceedings CORES 2013, 8th International Conference on Computer
Recognition Systems, Wroclaw, Poland, edited by R. Burduk et al., Springer,
2013, pp. 279–88.
short: 'S. Henzgen, M. Strickert, E. Hüllermeier, in: R. Burduk, K. Jackowski, M.
Kurzynski, M. Wozniak, A. Zolnierek (Eds.), In Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland, Springer, 2013, pp.
279–288.'
date_created: 2019-08-30T15:49:58Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: R.
full_name: Burduk, R.
last_name: Burduk
- first_name: K.
full_name: Jackowski, K.
last_name: Jackowski
- first_name: M.
full_name: Kurzynski, M.
last_name: Kurzynski
- first_name: M.
full_name: Wozniak, M.
last_name: Wozniak
- first_name: A.
full_name: Zolnierek, A.
last_name: Zolnierek
language:
- iso: eng
page: 279-288
publication: in Proceedings CORES 2013, 8th International Conference on Computer Recognition
Systems, Wroclaw, Poland
publisher: Springer
status: public
title: Rule chains for visualizing evolving fuzzy rule-based systems
type: conference
user_id: '49109'
year: '2013'
...
---
_id: '13190'
author:
- first_name: Ammar
full_name: Shaker, Ammar
last_name: Shaker
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Shaker A, Hüllermeier E. Recovery analysis for adaptive learning from non-stationary
data streams. In: Burduk R, Jackowski K, Kurzynski M, Wozniak W, Zolnierek A,
eds. In Proceedings CORES 2013, 8th International Conference on Computer Recognition
Systems, Wroclaw, Poland. Springer; 2013:289-298.'
apa: Shaker, A., & Hüllermeier, E. (2013). Recovery analysis for adaptive learning
from non-stationary data streams. In R. Burduk, K. Jackowski, M. Kurzynski, W.
Wozniak, & A. Zolnierek (Eds.), in Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland (pp. 289–298).
Springer.
bibtex: '@inproceedings{Shaker_Hüllermeier_2013, title={Recovery analysis for adaptive
learning from non-stationary data streams}, booktitle={in Proceedings CORES 2013,
8th International Conference on Computer Recognition Systems, Wroclaw, Poland},
publisher={Springer}, author={Shaker, Ammar and Hüllermeier, Eyke}, editor={Burduk,
R. and Jackowski, K. and Kurzynski, M. and Wozniak, W. and Zolnierek, A.Editors},
year={2013}, pages={289–298} }'
chicago: Shaker, Ammar, and Eyke Hüllermeier. “Recovery Analysis for Adaptive Learning
from Non-Stationary Data Streams.” In In Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland, edited by R.
Burduk, K. Jackowski, M. Kurzynski, W. Wozniak, and A. Zolnierek, 289–98. Springer,
2013.
ieee: A. Shaker and E. Hüllermeier, “Recovery analysis for adaptive learning from
non-stationary data streams,” in in Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland, 2013, pp. 289–298.
mla: Shaker, Ammar, and Eyke Hüllermeier. “Recovery Analysis for Adaptive Learning
from Non-Stationary Data Streams.” In Proceedings CORES 2013, 8th International
Conference on Computer Recognition Systems, Wroclaw, Poland, edited by R.
Burduk et al., Springer, 2013, pp. 289–98.
short: 'A. Shaker, E. Hüllermeier, in: R. Burduk, K. Jackowski, M. Kurzynski, W.
Wozniak, A. Zolnierek (Eds.), In Proceedings CORES 2013, 8th International Conference
on Computer Recognition Systems, Wroclaw, Poland, Springer, 2013, pp. 289–298.'
date_created: 2019-09-12T14:28:54Z
date_updated: 2022-01-06T06:51:30Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: R.
full_name: Burduk, R.
last_name: Burduk
- first_name: K.
full_name: Jackowski, K.
last_name: Jackowski
- first_name: M.
full_name: Kurzynski, M.
last_name: Kurzynski
- first_name: W.
full_name: Wozniak, W.
last_name: Wozniak
- first_name: A.
full_name: Zolnierek, A.
last_name: Zolnierek
language:
- iso: eng
page: 289-298
publication: in Proceedings CORES 2013, 8th International Conference on Computer Recognition
Systems, Wroclaw, Poland
publisher: Springer
status: public
title: Recovery analysis for adaptive learning from non-stationary data streams
type: conference
user_id: '49109'
year: '2013'
...
---
_id: '13645'
author:
- first_name: Tobias
full_name: Graf, Tobias
last_name: Graf
- first_name: Lars
full_name: Schäfers, Lars
last_name: Schäfers
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Graf T, Schäfers L, Platzner M. On Semeai Detection in Monte-Carlo Go. In:
Proceedings of the International Conference on Computers and Games (CG).
Springer; 2013.'
apa: Graf, T., Schäfers, L., & Platzner, M. (2013). On Semeai Detection in Monte-Carlo
Go. In Proceedings of the International Conference on Computers and Games (CG).
Springer.
bibtex: '@inproceedings{Graf_Schäfers_Platzner_2013, title={On Semeai Detection
in Monte-Carlo Go.}, booktitle={Proceedings of the International Conference on
Computers and Games (CG)}, publisher={Springer}, author={Graf, Tobias and Schäfers,
Lars and Platzner, Marco}, year={2013} }'
chicago: Graf, Tobias, Lars Schäfers, and Marco Platzner. “On Semeai Detection in
Monte-Carlo Go.” In Proceedings of the International Conference on Computers
and Games (CG). Springer, 2013.
ieee: T. Graf, L. Schäfers, and M. Platzner, “On Semeai Detection in Monte-Carlo
Go.,” in Proceedings of the International Conference on Computers and Games
(CG), 2013.
mla: Graf, Tobias, et al. “On Semeai Detection in Monte-Carlo Go.” Proceedings
of the International Conference on Computers and Games (CG), Springer, 2013.
short: 'T. Graf, L. Schäfers, M. Platzner, in: Proceedings of the International
Conference on Computers and Games (CG), Springer, 2013.'
date_created: 2019-10-04T22:50:51Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
language:
- iso: eng
publication: Proceedings of the International Conference on Computers and Games (CG)
publisher: Springer
status: public
title: On Semeai Detection in Monte-Carlo Go.
type: conference
user_id: '398'
year: '2013'
...
---
_id: '46385'
abstract:
- lang: eng
text: "In many applications one is faced with the problem that multiple objectives
have to be optimized at the same time. Since typically the solution set of such
multi-objective optimization problems forms a manifold which cannot be computed
analytically, one is in many cases interested in a suitable finite size approximation
of this set. One widely used approach is to find a representative set that maximizes
the dominated hypervolume that is defined by the images in objective space of
these solutions and a given reference point.\r\n\r\nIn this paper, we propose
a new point-wise iterative search procedure, Hypervolume Directed Search (HVDS),
that aims to increase the hypervolume of a given point in an archive for bi-objective
unconstrained optimization problems. We present the HVDS both as a standalone
algorithm and as a local searcher within a specialized evolutionary algorithm.
Numerical results confirm the strength of the novel approach."
author:
- first_name: Hernández V
full_name: Sosa, Hernández V
last_name: Sosa
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Sosa HV, Schütze O, Rudolph G, Trautmann H. The Directed Search Method for
Pareto Front Approximations with Maximum Dominated Hypervolume. In: Emmerich M,
Deutz A, Schuetze O, et al., eds. EVOLVE — A Bridge between Probability, Set
Oriented Numerics, and Evolutionary Computation IV. Vol 227. Advances in Intelligent
Systems and Computing. Springer International Publishing; 2013:189–205. doi:10.1007/978-3-319-01128-8_13'
apa: Sosa, H. V., Schütze, O., Rudolph, G., & Trautmann, H. (2013). The Directed
Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume.
In M. Emmerich, A. Deutz, O. Schuetze, T. Bäck, A. Tantar, P. Moral, P. Legrand,
P. Bouvry, & C. Coello (Eds.), EVOLVE — A Bridge between Probability, Set
Oriented Numerics, and Evolutionary Computation IV (Vol. 227, pp. 189–205).
Springer International Publishing. https://doi.org/10.1007/978-3-319-01128-8_13
bibtex: '@inbook{Sosa_Schütze_Rudolph_Trautmann_2013, series={Advances in Intelligent
Systems and Computing}, title={The Directed Search Method for Pareto Front Approximations
with Maximum Dominated Hypervolume}, volume={227}, DOI={10.1007/978-3-319-01128-8_13},
booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation IV}, publisher={Springer International Publishing}, author={Sosa,
Hernández V and Schütze, O and Rudolph, G and Trautmann, Heike}, editor={Emmerich,
M and Deutz, A and Schuetze, O and Bäck, T and Tantar, A and Moral, PD and Legrand,
P and Bouvry, P and Coello, CA}, year={2013}, pages={189–205}, collection={Advances
in Intelligent Systems and Computing} }'
chicago: Sosa, Hernández V, O Schütze, G Rudolph, and Heike Trautmann. “The Directed
Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume.”
In EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation IV, edited by M Emmerich, A Deutz, O Schuetze, T Bäck, A Tantar,
PD Moral, P Legrand, P Bouvry, and CA Coello, 227:189–205. Advances in Intelligent
Systems and Computing. Springer International Publishing, 2013. https://doi.org/10.1007/978-3-319-01128-8_13.
ieee: H. V. Sosa, O. Schütze, G. Rudolph, and H. Trautmann, “The Directed Search
Method for Pareto Front Approximations with Maximum Dominated Hypervolume,” in
EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation IV, vol. 227, M. Emmerich, A. Deutz, O. Schuetze, T. Bäck, A.
Tantar, P. Moral, P. Legrand, P. Bouvry, and C. Coello, Eds. Springer International
Publishing, 2013, pp. 189–205.
mla: Sosa, Hernández V., et al. “The Directed Search Method for Pareto Front Approximations
with Maximum Dominated Hypervolume.” EVOLVE — A Bridge between Probability,
Set Oriented Numerics, and Evolutionary Computation IV, edited by M Emmerich
et al., vol. 227, Springer International Publishing, 2013, pp. 189–205, doi:10.1007/978-3-319-01128-8_13.
short: 'H.V. Sosa, O. Schütze, G. Rudolph, H. Trautmann, in: M. Emmerich, A. Deutz,
O. Schuetze, T. Bäck, A. Tantar, P. Moral, P. Legrand, P. Bouvry, C. Coello (Eds.),
EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation IV, Springer International Publishing, 2013, pp. 189–205.'
date_created: 2023-08-04T15:37:00Z
date_updated: 2023-10-16T13:44:50Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-01128-8_13
editor:
- first_name: M
full_name: Emmerich, M
last_name: Emmerich
- first_name: A
full_name: Deutz, A
last_name: Deutz
- first_name: O
full_name: Schuetze, O
last_name: Schuetze
- first_name: T
full_name: Bäck, T
last_name: Bäck
- first_name: A
full_name: Tantar, A
last_name: Tantar
- first_name: PD
full_name: Moral, PD
last_name: Moral
- first_name: P
full_name: Legrand, P
last_name: Legrand
- first_name: P
full_name: Bouvry, P
last_name: Bouvry
- first_name: CA
full_name: Coello, CA
last_name: Coello
intvolume: ' 227'
language:
- iso: eng
page: 189–205
publication: EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation IV
publication_identifier:
isbn:
- 978-3-319-01127-1
publisher: Springer International Publishing
series_title: Advances in Intelligent Systems and Computing
status: public
title: The Directed Search Method for Pareto Front Approximations with Maximum Dominated
Hypervolume
type: book_chapter
user_id: '15504'
volume: 227
year: '2013'
...
---
_id: '46386'
abstract:
- lang: eng
text: The averaged Hausdorff distance Δ p is a performance indicator in multi-objective
evolutionary optimization which simultaneously takes into account proximity to
the true Pareto front and uniform spread of solutions. Recently, the multi-objective
evolutionary algorithm Δ p -EMOA was introduced which successfully generates evenly
spaced Pareto front approximations for bi-objective problems by integrating an
external archiving strategy into the SMS-EMOA based on Δ p . In this work a conceptual
generalization of the Δ p -EMOA for higher objective space dimensions is presented
and experimentally compared to state-of-the art EMOA as well as specialized EMOA
variants on three-dimensional optimization problems.
author:
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: C
full_name: Dominguez-Medina, C
last_name: Dominguez-Medina
- first_name: O
full_name: Schütze, O
last_name: Schütze
citation:
ama: 'Trautmann H, Rudolph G, Dominguez-Medina C, Schütze O. Finding Evenly Spaced
Pareto Fronts for Three-Objective Optimization Problems. In: Schütze O, Coello
CC, Tantar A, et al., eds. EVOLVE — A Bridge between Probability, Set Oriented
Numerics, and Evolutionary Computation II. Vol 175. Advances in Intelligent
Systems and Computing. Springer Berlin Heidelberg; 2013:89–105. doi:10.1007/978-3-642-31519-0_6'
apa: Trautmann, H., Rudolph, G., Dominguez-Medina, C., & Schütze, O. (2013).
Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.
In O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, &
P. Legrand (Eds.), EVOLVE — A Bridge between Probability, Set Oriented Numerics,
and Evolutionary Computation II (Vol. 175, pp. 89–105). Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-31519-0_6
bibtex: '@inbook{Trautmann_Rudolph_Dominguez-Medina_Schütze_2013, series={Advances
in Intelligent Systems and Computing}, title={Finding Evenly Spaced Pareto Fronts
for Three-Objective Optimization Problems}, volume={175}, DOI={10.1007/978-3-642-31519-0_6},
booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation II}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike
and Rudolph, G and Dominguez-Medina, C and Schütze, O}, editor={Schütze, O and
Coello, Coello CA and Tantar, A and Tantar, E and Bouvry, P and Del, Moral P and
Legrand, P}, year={2013}, pages={89–105}, collection={Advances in Intelligent
Systems and Computing} }'
chicago: Trautmann, Heike, G Rudolph, C Dominguez-Medina, and O Schütze. “Finding
Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” In EVOLVE
— A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation
II, edited by O Schütze, Coello CA Coello, A Tantar, E Tantar, P Bouvry, Moral
P Del, and P Legrand, 175:89–105. Advances in Intelligent Systems and Computing.
Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-31519-0_6.
ieee: H. Trautmann, G. Rudolph, C. Dominguez-Medina, and O. Schütze, “Finding Evenly
Spaced Pareto Fronts for Three-Objective Optimization Problems,” in EVOLVE
— A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation
II, vol. 175, O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M.
P. Del, and P. Legrand, Eds. Springer Berlin Heidelberg, 2013, pp. 89–105.
mla: Trautmann, Heike, et al. “Finding Evenly Spaced Pareto Fronts for Three-Objective
Optimization Problems.” EVOLVE — A Bridge between Probability, Set Oriented
Numerics, and Evolutionary Computation II, edited by O Schütze et al., vol.
175, Springer Berlin Heidelberg, 2013, pp. 89–105, doi:10.1007/978-3-642-31519-0_6.
short: 'H. Trautmann, G. Rudolph, C. Dominguez-Medina, O. Schütze, in: O. Schütze,
C.C. Coello, A. Tantar, E. Tantar, P. Bouvry, M.P. Del, P. Legrand (Eds.), EVOLVE
— A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation
II, Springer Berlin Heidelberg, 2013, pp. 89–105.'
date_created: 2023-08-04T15:38:25Z
date_updated: 2023-10-16T13:45:12Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-642-31519-0_6
editor:
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: Coello CA
full_name: Coello, Coello CA
last_name: Coello
- first_name: A
full_name: Tantar, A
last_name: Tantar
- first_name: E
full_name: Tantar, E
last_name: Tantar
- first_name: P
full_name: Bouvry, P
last_name: Bouvry
- first_name: Moral P
full_name: Del, Moral P
last_name: Del
- first_name: P
full_name: Legrand, P
last_name: Legrand
intvolume: ' 175'
language:
- iso: eng
page: 89–105
publication: EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary
Computation II
publication_identifier:
isbn:
- 978-3-642-31518-3
publisher: Springer Berlin Heidelberg
series_title: Advances in Intelligent Systems and Computing
status: public
title: Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems
type: book_chapter
user_id: '15504'
volume: 175
year: '2013'
...
---
_id: '46388'
abstract:
- lang: eng
text: Understanding the behaviour of well-known algorithms for classical NP-hard
optimisation problems is still a difficult task. With this paper, we contribute
to this research direction and carry out a feature based comparison of local search
and the well-known Christofides approximation algorithm for the Traveling Salesperson
Problem. We use an evolutionary algorithm approach to construct easy and hard
instances for the Christofides algorithm, where we measure hardness in terms of
approximation ratio. Our results point out important features and lead to hard
and easy instances for this famous algorithm. Furthermore, our cross-comparison
gives new insights on the complementary benefits of the different approaches.
author:
- first_name: Samadhi
full_name: Nallaperuma, Samadhi
last_name: Nallaperuma
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Nallaperuma S, Wagner M, Neumann F, Bischl B, Mersmann O, Trautmann H. A Feature-Based
Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson
Problem. In: Proceedings of the Twelfth Workshop on Foundations of Genetic
Algorithms XII. FOGA XII ’13. Association for Computing Machinery; 2013:147–160.
doi:10.1145/2460239.2460253'
apa: Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., & Trautmann,
H. (2013). A Feature-Based Comparison of Local Search and the Christofides Algorithm
for the Travelling Salesperson Problem. Proceedings of the Twelfth Workshop
on Foundations of Genetic Algorithms XII, 147–160. https://doi.org/10.1145/2460239.2460253
bibtex: '@inproceedings{Nallaperuma_Wagner_Neumann_Bischl_Mersmann_Trautmann_2013,
place={New York, NY, USA}, series={FOGA XII ’13}, title={A Feature-Based Comparison
of Local Search and the Christofides Algorithm for the Travelling Salesperson
Problem}, DOI={10.1145/2460239.2460253},
booktitle={Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms
XII}, publisher={Association for Computing Machinery}, author={Nallaperuma, Samadhi
and Wagner, Markus and Neumann, Frank and Bischl, Bernd and Mersmann, Olaf and
Trautmann, Heike}, year={2013}, pages={147–160}, collection={FOGA XII ’13} }'
chicago: 'Nallaperuma, Samadhi, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf
Mersmann, and Heike Trautmann. “A Feature-Based Comparison of Local Search and
the Christofides Algorithm for the Travelling Salesperson Problem.” In Proceedings
of the Twelfth Workshop on Foundations of Genetic Algorithms XII, 147–160.
FOGA XII ’13. New York, NY, USA: Association for Computing Machinery, 2013. https://doi.org/10.1145/2460239.2460253.'
ieee: 'S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, and H. Trautmann,
“A Feature-Based Comparison of Local Search and the Christofides Algorithm for
the Travelling Salesperson Problem,” in Proceedings of the Twelfth Workshop
on Foundations of Genetic Algorithms XII, 2013, pp. 147–160, doi: 10.1145/2460239.2460253.'
mla: Nallaperuma, Samadhi, et al. “A Feature-Based Comparison of Local Search and
the Christofides Algorithm for the Travelling Salesperson Problem.” Proceedings
of the Twelfth Workshop on Foundations of Genetic Algorithms XII, Association
for Computing Machinery, 2013, pp. 147–160, doi:10.1145/2460239.2460253.
short: 'S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, H. Trautmann,
in: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII,
Association for Computing Machinery, New York, NY, USA, 2013, pp. 147–160.'
date_created: 2023-08-04T15:42:03Z
date_updated: 2023-10-16T13:45:53Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2460239.2460253
keyword:
- approximation algorithms
- local search
- traveling salesperson problem
- feature selection
- prediction
- classification
language:
- iso: eng
page: 147–160
place: New York, NY, USA
publication: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms
XII
publication_identifier:
isbn:
- '9781450319904'
publisher: Association for Computing Machinery
series_title: FOGA XII ’13
status: public
title: A Feature-Based Comparison of Local Search and the Christofides Algorithm for
the Travelling Salesperson Problem
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46390'
abstract:
- lang: eng
text: In some technical applications like multiobjective online control an evenly
spaced approximation of the Pareto front is desired. Since standard evolutionary
multiobjective optimization (EMO) algorithms have not been designed for that kind
of approximation we propose an archive-based plug-in method that builds an evenly
spaced approximation using averaged Hausdorff measure between archive and reference
front. In case of three objectives this reference font is constructed from a triangulated
approximation of the Pareto front from a previous experiment. The plug-in can
be deployed in online or offline mode for any kind of EMO algorithm.
author:
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: S
full_name: Sengupta, S
last_name: Sengupta
- first_name: O
full_name: Schütze, O
last_name: Schütze
citation:
ama: 'Rudolph G, Trautmann H, Sengupta S, Schütze O. Evenly Spaced Pareto Front
Approximations for Tricriteria Problems Based on Triangulation. In: Purshouse
R, Fleming P, Fonseca C, Greco S, Shaw J, eds. Evolutionary Multi-Criterion
Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings.
Vol 7811. Lecture Notes in Computer Science. Springer; 2013:443–458. doi:https://doi.org/10.1007/978-3-642-37140-0_34'
apa: Rudolph, G., Trautmann, H., Sengupta, S., & Schütze, O. (2013). Evenly
Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.
In R. Purshouse, P. Fleming, C. Fonseca, S. Greco, & J. Shaw (Eds.), Evolutionary
Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield,
UK, Proceedings (Vol. 7811, pp. 443–458). Springer. https://doi.org/10.1007/978-3-642-37140-0_34
bibtex: '@inproceedings{Rudolph_Trautmann_Sengupta_Schütze_2013, series={Lecture
Notes in Computer Science}, title={Evenly Spaced Pareto Front Approximations for
Tricriteria Problems Based on Triangulation}, volume={7811}, DOI={https://doi.org/10.1007/978-3-642-37140-0_34},
booktitle={Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference,
EMO 2013, Sheffield, UK, Proceedings}, publisher={Springer}, author={Rudolph,
G and Trautmann, Heike and Sengupta, S and Schütze, O}, editor={Purshouse, RC
and Fleming, PJ and Fonseca, CM and Greco, S and Shaw, J}, year={2013}, pages={443–458},
collection={Lecture Notes in Computer Science} }'
chicago: Rudolph, G, Heike Trautmann, S Sengupta, and O Schütze. “Evenly Spaced
Pareto Front Approximations for Tricriteria Problems Based on Triangulation.”
In Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference,
EMO 2013, Sheffield, UK, Proceedings, edited by RC Purshouse, PJ Fleming,
CM Fonseca, S Greco, and J Shaw, 7811:443–458. Lecture Notes in Computer Science.
Springer, 2013. https://doi.org/10.1007/978-3-642-37140-0_34.
ieee: 'G. Rudolph, H. Trautmann, S. Sengupta, and O. Schütze, “Evenly Spaced Pareto
Front Approximations for Tricriteria Problems Based on Triangulation,” in Evolutionary
Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield,
UK, Proceedings, 2013, vol. 7811, pp. 443–458, doi: https://doi.org/10.1007/978-3-642-37140-0_34.'
mla: Rudolph, G., et al. “Evenly Spaced Pareto Front Approximations for Tricriteria
Problems Based on Triangulation.” Evolutionary Multi-Criterion Optimization
— 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings, edited
by RC Purshouse et al., vol. 7811, Springer, 2013, pp. 443–458, doi:https://doi.org/10.1007/978-3-642-37140-0_34.
short: 'G. Rudolph, H. Trautmann, S. Sengupta, O. Schütze, in: R. Purshouse, P.
Fleming, C. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization
— 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings, Springer,
2013, pp. 443–458.'
date_created: 2023-08-04T15:43:38Z
date_updated: 2023-10-16T13:46:35Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1007/978-3-642-37140-0_34
editor:
- first_name: RC
full_name: Purshouse, RC
last_name: Purshouse
- first_name: PJ
full_name: Fleming, PJ
last_name: Fleming
- first_name: CM
full_name: Fonseca, CM
last_name: Fonseca
- first_name: S
full_name: Greco, S
last_name: Greco
- first_name: J
full_name: Shaw, J
last_name: Shaw
intvolume: ' 7811'
language:
- iso: eng
page: 443–458
publication: Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference,
EMO 2013, Sheffield, UK, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on
Triangulation
type: conference
user_id: '15504'
volume: 7811
year: '2013'
...
---
_id: '46391'
abstract:
- lang: eng
text: Indicator based evolutionary algorithms have caught the interest of many researchers
for the treatment of multi-objective optimization problems in the recent past
since they deliver the desired approximation of the solution set and due to a
usually better performance compared to dominance based algorithms. Nevertheless,
these methods still suffer the drawback that many function evaluations are required
to obtain a suitable representation of the solution set. The aim of this study
is to present the Directed Search (DS) Method as local searcher within global
indicator based optimization algorithms. For this, we will present the DS in the
context of hypervolume maximization leading to both a new local search algorithm
and a new memetic algorithm. Further, we will present first attempts to adapt
the DS to a class of parameter dependent problems.
author:
- first_name: VA
full_name: Sosa-Hernandez, VA
last_name: Sosa-Hernandez
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: G
full_name: Rudoph, G
last_name: Rudoph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Sosa-Hernandez V, Schütze O, Rudoph G, Trautmann H. Directed Search Method
for Indicator-based Multi-objective Evolutionary Algorithms. In: Proceeding
of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion. GECCO ’13 Companion. ACM; 2013:1699–1702. doi:10.1145/2464576.2482756'
apa: Sosa-Hernandez, V., Schütze, O., Rudoph, G., & Trautmann, H. (2013). Directed
Search Method for Indicator-based Multi-objective Evolutionary Algorithms. Proceeding
of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion, 1699–1702. https://doi.org/10.1145/2464576.2482756
bibtex: '@inproceedings{Sosa-Hernandez_Schütze_Rudoph_Trautmann_2013, place={New
York, NY, USA}, series={GECCO ’13 Companion}, title={Directed Search Method for
Indicator-based Multi-objective Evolutionary Algorithms}, DOI={10.1145/2464576.2482756},
booktitle={Proceeding of the Fifteenth Annual Conference Companion on Genetic
and Evolutionary Computation Conference Companion}, publisher={ACM}, author={Sosa-Hernandez,
VA and Schütze, O and Rudoph, G and Trautmann, Heike}, year={2013}, pages={1699–1702},
collection={GECCO ’13 Companion} }'
chicago: 'Sosa-Hernandez, VA, O Schütze, G Rudoph, and Heike Trautmann. “Directed
Search Method for Indicator-Based Multi-Objective Evolutionary Algorithms.” In
Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary
Computation Conference Companion, 1699–1702. GECCO ’13 Companion. New York,
NY, USA: ACM, 2013. https://doi.org/10.1145/2464576.2482756.'
ieee: 'V. Sosa-Hernandez, O. Schütze, G. Rudoph, and H. Trautmann, “Directed Search
Method for Indicator-based Multi-objective Evolutionary Algorithms,” in Proceeding
of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion, 2013, pp. 1699–1702, doi: 10.1145/2464576.2482756.'
mla: Sosa-Hernandez, VA, et al. “Directed Search Method for Indicator-Based Multi-Objective
Evolutionary Algorithms.” Proceeding of the Fifteenth Annual Conference Companion
on Genetic and Evolutionary Computation Conference Companion, ACM, 2013, pp.
1699–1702, doi:10.1145/2464576.2482756.
short: 'V. Sosa-Hernandez, O. Schütze, G. Rudoph, H. Trautmann, in: Proceeding of
the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion, ACM, New York, NY, USA, 2013, pp. 1699–1702.'
date_created: 2023-08-04T15:45:26Z
date_updated: 2023-10-16T13:46:54Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2464576.2482756
language:
- iso: eng
page: 1699–1702
place: New York, NY, USA
publication: Proceeding of the Fifteenth Annual Conference Companion on Genetic and
Evolutionary Computation Conference Companion
publisher: ACM
series_title: GECCO ’13 Companion
status: public
title: Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46387'
abstract:
- lang: eng
text: Here we address the problem of computing finite size Hausdorff approximations
of the Pareto front of four-objective optimization problems by means of evolutionary
computing. Since many applications desire an approximation evenly spread along
the Pareto front and approximations that are good in the Hausdorff sense are typically
evenly spread along the Pareto front we consider three different evolutionary
multi-objective algorithms tailored to that purpose, where two of them are based
on the Part and Selection Algorithm (PSA). Finally, we present some numerical
results indicating the strength of the novel methods.
author:
- first_name: C
full_name: Dominguez-Medina, C
last_name: Dominguez-Medina
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Dominguez-Medina C, Rudolph G, Schütze O, Trautmann H. Evenly spaced Pareto
fronts of quad-objective problems using PSA partitioning technique. In: Proceedings
of the 2013 IEEE Congress on Evolutionary Computation (CEC). ; 2013:3190–3197.
doi:https://doi.org/10.1109/CEC.2013.6557960'
apa: Dominguez-Medina, C., Rudolph, G., Schütze, O., & Trautmann, H. (2013).
Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning
technique. Proceedings of the 2013 IEEE Congress on Evolutionary Computation
(CEC), 3190–3197. https://doi.org/10.1109/CEC.2013.6557960
bibtex: '@inproceedings{Dominguez-Medina_Rudolph_Schütze_Trautmann_2013, place={Cancun,
Mexico}, title={Evenly spaced Pareto fronts of quad-objective problems using PSA
partitioning technique}, DOI={https://doi.org/10.1109/CEC.2013.6557960},
booktitle={Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)},
author={Dominguez-Medina, C and Rudolph, G and Schütze, O and Trautmann, Heike},
year={2013}, pages={3190–3197} }'
chicago: Dominguez-Medina, C, G Rudolph, O Schütze, and Heike Trautmann. “Evenly
Spaced Pareto Fronts of Quad-Objective Problems Using PSA Partitioning Technique.”
In Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC),
3190–3197. Cancun, Mexico, 2013. https://doi.org/10.1109/CEC.2013.6557960.
ieee: 'C. Dominguez-Medina, G. Rudolph, O. Schütze, and H. Trautmann, “Evenly spaced
Pareto fronts of quad-objective problems using PSA partitioning technique,” in
Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC),
2013, pp. 3190–3197, doi: https://doi.org/10.1109/CEC.2013.6557960.'
mla: Dominguez-Medina, C., et al. “Evenly Spaced Pareto Fronts of Quad-Objective
Problems Using PSA Partitioning Technique.” Proceedings of the 2013 IEEE Congress
on Evolutionary Computation (CEC), 2013, pp. 3190–3197, doi:https://doi.org/10.1109/CEC.2013.6557960.
short: 'C. Dominguez-Medina, G. Rudolph, O. Schütze, H. Trautmann, in: Proceedings
of the 2013 IEEE Congress on Evolutionary Computation (CEC), Cancun, Mexico, 2013,
pp. 3190–3197.'
date_created: 2023-08-04T15:40:15Z
date_updated: 2023-10-16T13:45:34Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1109/CEC.2013.6557960
language:
- iso: eng
page: 3190–3197
place: Cancun, Mexico
publication: Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)
status: public
title: Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning
technique
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46389'
abstract:
- lang: eng
text: Current StarCraft bots are not very flexible in their strategy choice, most
of them just follow a manually optimized one, usually a rush. We suggest a method
of augmenting existing bots via Fuzzy Control in order to make them react on the
current game situation. According to the available information, the best matching
of a pool of strategies is chosen. While the method is very general and can be
applied easily to many bots, we implement it for the existing BTHAI bot and show
experimentally how the modifications affects its gameplay, and how it is improved
compared to the original version.
author:
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Daniel
full_name: Kozakowski, Daniel
last_name: Kozakowski
- first_name: Johan
full_name: Hagelbäck, Johan
last_name: Hagelbäck
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Preuss M, Kozakowski D, Hagelbäck J, Trautmann H. Reactive strategy choice
in StarCraft by means of Fuzzy Control. In: 2013 IEEE Conference on Computational
Inteligence in Games (CIG). ; 2013:1-8. doi:10.1109/CIG.2013.6633627'
apa: Preuss, M., Kozakowski, D., Hagelbäck, J., & Trautmann, H. (2013). Reactive
strategy choice in StarCraft by means of Fuzzy Control. 2013 IEEE Conference
on Computational Inteligence in Games (CIG), 1–8. https://doi.org/10.1109/CIG.2013.6633627
bibtex: '@inproceedings{Preuss_Kozakowski_Hagelbäck_Trautmann_2013, title={Reactive
strategy choice in StarCraft by means of Fuzzy Control}, DOI={10.1109/CIG.2013.6633627},
booktitle={2013 IEEE Conference on Computational Inteligence in Games (CIG)},
author={Preuss, Mike and Kozakowski, Daniel and Hagelbäck, Johan and Trautmann,
Heike}, year={2013}, pages={1–8} }'
chicago: Preuss, Mike, Daniel Kozakowski, Johan Hagelbäck, and Heike Trautmann.
“Reactive Strategy Choice in StarCraft by Means of Fuzzy Control.” In 2013
IEEE Conference on Computational Inteligence in Games (CIG), 1–8, 2013. https://doi.org/10.1109/CIG.2013.6633627.
ieee: 'M. Preuss, D. Kozakowski, J. Hagelbäck, and H. Trautmann, “Reactive strategy
choice in StarCraft by means of Fuzzy Control,” in 2013 IEEE Conference on
Computational Inteligence in Games (CIG), 2013, pp. 1–8, doi: 10.1109/CIG.2013.6633627.'
mla: Preuss, Mike, et al. “Reactive Strategy Choice in StarCraft by Means of Fuzzy
Control.” 2013 IEEE Conference on Computational Inteligence in Games (CIG),
2013, pp. 1–8, doi:10.1109/CIG.2013.6633627.
short: 'M. Preuss, D. Kozakowski, J. Hagelbäck, H. Trautmann, in: 2013 IEEE Conference
on Computational Inteligence in Games (CIG), 2013, pp. 1–8.'
date_created: 2023-08-04T15:42:58Z
date_updated: 2023-10-16T13:46:13Z
department:
- _id: '34'
- _id: '819'
doi: 10.1109/CIG.2013.6633627
language:
- iso: eng
page: 1-8
publication: 2013 IEEE Conference on Computational Inteligence in Games (CIG)
status: public
title: Reactive strategy choice in StarCraft by means of Fuzzy Control
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46395'
abstract:
- lang: eng
text: In multiobjective optimization, the identification of practically relevant
solutions on the Pareto-optimal front is an important research topic. Desirability
functions (DFs) allow the preferences of the decision maker to be specified in
an intuitive way. Recently, it has been shown for continuous optimization problems
that an a priori transformation of the objectives by means of DFs can be used
to focus the search of a hypervolume-based evolutionary algorithm on the desired
part of the front. In many-objective optimization, however, the computational
complexity of the hypervolume can become a crucial part. Thus, an alternative
to this approach will be presented in this paper. The new algorithm operates in
the untransformed objective space, but the desirability index (DI), that is, a
DF-based scalarization, will be used as the second-level selection criterion in
the non-dominated sorting. The diversity and uniform distribution of the resulting
approximation are ensured by the use of an external archive. In the experiments,
different preferences are specified as DFs, and their effects are investigated.
It is shown that trade-off solutions are generated in the desired regions of the
Pareto-optimal front and with a density adaptive to the DI. The efficiency of
the approach with respect to increasing objective space dimension is also analysed
using scalable test functions. The convergence speed is superior to other set-based
and preference-based evolutionary multiobjective algorithms while the approach
is of low computational complexity due to cheap DI evaluations. Copyright © 2013
John Wiley & Sons, Ltd.
author:
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: T
full_name: Wagner, T
last_name: Wagner
- first_name: D
full_name: Biermann, D
last_name: Biermann
- first_name: C
full_name: Weihs, C
last_name: Weihs
citation:
ama: Trautmann H, Wagner T, Biermann D, Weihs C. Indicator-based Selection in Evolutionary
Multiobjective Optimization Algorithms Based On the Desirability Index. Journal
of Multi-Criteria Decision Analysis. 2013;20(5-6):319–337. doi:https://doi.org/10.1002/mcda.1503
apa: Trautmann, H., Wagner, T., Biermann, D., & Weihs, C. (2013). Indicator-based
Selection in Evolutionary Multiobjective Optimization Algorithms Based On the
Desirability Index. Journal of Multi-Criteria Decision Analysis, 20(5–6),
319–337. https://doi.org/10.1002/mcda.1503
bibtex: '@article{Trautmann_Wagner_Biermann_Weihs_2013, title={Indicator-based Selection
in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability
Index}, volume={20}, DOI={https://doi.org/10.1002/mcda.1503},
number={5–6}, journal={Journal of Multi-Criteria Decision Analysis}, author={Trautmann,
Heike and Wagner, T and Biermann, D and Weihs, C}, year={2013}, pages={319–337}
}'
chicago: 'Trautmann, Heike, T Wagner, D Biermann, and C Weihs. “Indicator-Based
Selection in Evolutionary Multiobjective Optimization Algorithms Based On the
Desirability Index.” Journal of Multi-Criteria Decision Analysis 20, no.
5–6 (2013): 319–337. https://doi.org/10.1002/mcda.1503.'
ieee: 'H. Trautmann, T. Wagner, D. Biermann, and C. Weihs, “Indicator-based Selection
in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability
Index,” Journal of Multi-Criteria Decision Analysis, vol. 20, no. 5–6,
pp. 319–337, 2013, doi: https://doi.org/10.1002/mcda.1503.'
mla: Trautmann, Heike, et al. “Indicator-Based Selection in Evolutionary Multiobjective
Optimization Algorithms Based On the Desirability Index.” Journal of Multi-Criteria
Decision Analysis, vol. 20, no. 5–6, 2013, pp. 319–337, doi:https://doi.org/10.1002/mcda.1503.
short: H. Trautmann, T. Wagner, D. Biermann, C. Weihs, Journal of Multi-Criteria
Decision Analysis 20 (2013) 319–337.
date_created: 2023-08-04T15:50:03Z
date_updated: 2023-10-16T13:48:31Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1002/mcda.1503
intvolume: ' 20'
issue: 5-6
language:
- iso: eng
page: 319–337
publication: Journal of Multi-Criteria Decision Analysis
status: public
title: Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms
Based On the Desirability Index
type: journal_article
user_id: '15504'
volume: 20
year: '2013'
...
---
_id: '46393'
abstract:
- lang: eng
text: In multi-objective optimization, set-based performance indicators have become
the state of the art for assessing the quality of Pareto front approximations.
As a consequence, they are also more and more used within the design of multi-objective
optimization algorithms. The R2 and the Hypervolume (HV) indicator represent two
popular examples. In order to understand the behavior and the approximations preferred
by these indicators and algorithms, a comprehensive knowledge of the indicator’s
properties is required. Whereas this knowledge is available for the HV, we presented
a first approach in this direction for the R2 indicator just recently. In this
paper, we build upon this knowledge and enhance the considerations with respect
to the integration of preferences into the R2 indicator. More specifically, we
analyze the effect of the reference point, the domain of the weights, and the
distribution of weight vectors on the optimization of $\mu$ solutions with respect
to the R2 indicator. By means of theoretical findings and empirical evidence,
we show the potentials of these three possibilities using the optimal distribution
of $\mu$ solutions for exemplary setups.
author:
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
citation:
ama: 'Wagner T, Trautmann H, Brockhoff D. Preference Articulation by Means of the
R2 Indicator. In: Purshouse RC, Fleming PJ, Fonseca CM, Greco S, Shaw J, eds.
Evolutionary Multi-Criterion Optimization. Springer Berlin Heidelberg;
2013:81–95.'
apa: Wagner, T., Trautmann, H., & Brockhoff, D. (2013). Preference Articulation
by Means of the R2 Indicator. In R. C. Purshouse, P. J. Fleming, C. M. Fonseca,
S. Greco, & J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization
(pp. 81–95). Springer Berlin Heidelberg.
bibtex: '@inproceedings{Wagner_Trautmann_Brockhoff_2013, place={Berlin, Heidelberg},
title={Preference Articulation by Means of the R2 Indicator}, booktitle={Evolutionary
Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner,
Tobias and Trautmann, Heike and Brockhoff, Dimo}, editor={Purshouse, Robin C.
and Fleming, Peter J. and Fonseca, Carlos M. and Greco, Salvatore and Shaw, Jane},
year={2013}, pages={81–95} }'
chicago: 'Wagner, Tobias, Heike Trautmann, and Dimo Brockhoff. “Preference Articulation
by Means of the R2 Indicator.” In Evolutionary Multi-Criterion Optimization,
edited by Robin C. Purshouse, Peter J. Fleming, Carlos M. Fonseca, Salvatore Greco,
and Jane Shaw, 81–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.'
ieee: T. Wagner, H. Trautmann, and D. Brockhoff, “Preference Articulation by Means
of the R2 Indicator,” in Evolutionary Multi-Criterion Optimization, 2013,
pp. 81–95.
mla: Wagner, Tobias, et al. “Preference Articulation by Means of the R2 Indicator.”
Evolutionary Multi-Criterion Optimization, edited by Robin C. Purshouse
et al., Springer Berlin Heidelberg, 2013, pp. 81–95.
short: 'T. Wagner, H. Trautmann, D. Brockhoff, in: R.C. Purshouse, P.J. Fleming,
C.M. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 81–95.'
date_created: 2023-08-04T15:47:49Z
date_updated: 2023-10-16T13:47:58Z
department:
- _id: '34'
- _id: '819'
editor:
- first_name: Robin C.
full_name: Purshouse, Robin C.
last_name: Purshouse
- first_name: Peter J.
full_name: Fleming, Peter J.
last_name: Fleming
- first_name: Carlos M.
full_name: Fonseca, Carlos M.
last_name: Fonseca
- first_name: Salvatore
full_name: Greco, Salvatore
last_name: Greco
- first_name: Jane
full_name: Shaw, Jane
last_name: Shaw
language:
- iso: eng
page: 81–95
place: Berlin, Heidelberg
publication: Evolutionary Multi-Criterion Optimization
publication_identifier:
isbn:
- 978-3-642-37140-0
publisher: Springer Berlin Heidelberg
status: public
title: Preference Articulation by Means of the R2 Indicator
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46392'
abstract:
- lang: eng
text: An indicator-based evolutionary multiobjective optimization algorithm (EMOA)
is introduced which incorporates the contribution to the unary R2-indicator as
the secondary selection criterion. First experiments indicate that the R2-EMOA
accurately approximates the Pareto front of the considered continuous multiobjective
optimization problems. Furthermore, decision makers’ preferences can be included
by adjusting the weight vector distributions of the indicator which results in
a focused search behavior.
author:
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
citation:
ama: 'Trautmann H, Wagner T, Brockhoff D. R2-EMOA: Focused Multiobjective Search
Using R2-Indicator-Based Selection. In: Nicosia G, Pardalos P, eds. Learning
and Intelligent Optimization. Springer Berlin Heidelberg; 2013:70–74.'
apa: 'Trautmann, H., Wagner, T., & Brockhoff, D. (2013). R2-EMOA: Focused Multiobjective
Search Using R2-Indicator-Based Selection. In G. Nicosia & P. Pardalos (Eds.),
Learning and Intelligent Optimization (pp. 70–74). Springer Berlin Heidelberg.'
bibtex: '@inproceedings{Trautmann_Wagner_Brockhoff_2013, place={Berlin, Heidelberg},
title={R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection},
booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin
Heidelberg}, author={Trautmann, Heike and Wagner, Tobias and Brockhoff, Dimo},
editor={Nicosia, Giuseppe and Pardalos, Panos}, year={2013}, pages={70–74} }'
chicago: 'Trautmann, Heike, Tobias Wagner, and Dimo Brockhoff. “R2-EMOA: Focused
Multiobjective Search Using R2-Indicator-Based Selection.” In Learning and
Intelligent Optimization, edited by Giuseppe Nicosia and Panos Pardalos, 70–74.
Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.'
ieee: 'H. Trautmann, T. Wagner, and D. Brockhoff, “R2-EMOA: Focused Multiobjective
Search Using R2-Indicator-Based Selection,” in Learning and Intelligent Optimization,
2013, pp. 70–74.'
mla: 'Trautmann, Heike, et al. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based
Selection.” Learning and Intelligent Optimization, edited by Giuseppe Nicosia
and Panos Pardalos, Springer Berlin Heidelberg, 2013, pp. 70–74.'
short: 'H. Trautmann, T. Wagner, D. Brockhoff, in: G. Nicosia, P. Pardalos (Eds.),
Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg,
2013, pp. 70–74.'
date_created: 2023-08-04T15:47:00Z
date_updated: 2023-10-16T13:47:41Z
department:
- _id: '34'
- _id: '819'
editor:
- first_name: Giuseppe
full_name: Nicosia, Giuseppe
last_name: Nicosia
- first_name: Panos
full_name: Pardalos, Panos
last_name: Pardalos
language:
- iso: eng
page: 70–74
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-642-44973-4
publisher: Springer Berlin Heidelberg
status: public
title: 'R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '48889'
abstract:
- lang: eng
text: Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization
problems. With this paper we contribute to the understanding of the success of
2-opt based local search algorithms for solving the traveling salesperson problem
(TSP). Although 2-opt is widely used in practice, it is hard to understand its
success from a theoretical perspective. We take a statistical approach and examine
the features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based
Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.
Annals of Mathematics and Artificial Intelligence. 2013;69(2):151–182.
doi:10.1007/s10472-013-9341-2
apa: Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann,
F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesperson Problem. Annals of Mathematics and Artificial
Intelligence, 69(2), 151–182. https://doi.org/10.1007/s10472-013-9341-2
bibtex: '@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A
Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling
Salesperson Problem}, volume={69}, DOI={10.1007/s10472-013-9341-2},
number={2}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann,
Olaf and Bischl, Bernd and Trautmann, Heike and Wagner, Markus and Bossek, Jakob
and Neumann, Frank}, year={2013}, pages={151–182} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek,
and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesperson Problem.” Annals of Mathematics and Artificial
Intelligence 69, no. 2 (2013): 151–182. https://doi.org/10.1007/s10472-013-9341-2.'
ieee: 'O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann,
“A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesperson Problem,” Annals of Mathematics and Artificial Intelligence,
vol. 69, no. 2, pp. 151–182, 2013, doi: 10.1007/s10472-013-9341-2.'
mla: Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm
Performance for the Traveling Salesperson Problem.” Annals of Mathematics and
Artificial Intelligence, vol. 69, no. 2, 2013, pp. 151–182, doi:10.1007/s10472-013-9341-2.
short: O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals
of Mathematics and Artificial Intelligence 69 (2013) 151–182.
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:50:41Z
department:
- _id: '819'
doi: 10.1007/s10472-013-9341-2
intvolume: ' 69'
issue: '2'
keyword:
- 2-opt
- 90B06
- Classification
- Feature selection
- MARS
- TSP
language:
- iso: eng
page: 151–182
publication: Annals of Mathematics and Artificial Intelligence
publication_identifier:
issn:
- 1012-2443
status: public
title: A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesperson Problem
type: journal_article
user_id: '102979'
volume: 69
year: '2013'
...
---
_id: '47161'
author:
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
- first_name: Marian
full_name: Harbach, Marian
last_name: Harbach
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
- first_name: Matthew
full_name: Smith, Matthew
last_name: Smith
citation:
ama: 'Fahl S, Harbach M, Acar Y, Smith M. On the ecological validity of a password
study. In: Proceedings of the Ninth Symposium on Usable Privacy and Security.
ACM; 2013. doi:10.1145/2501604.2501617'
apa: Fahl, S., Harbach, M., Acar, Y., & Smith, M. (2013). On the ecological
validity of a password study. Proceedings of the Ninth Symposium on Usable
Privacy and Security. https://doi.org/10.1145/2501604.2501617
bibtex: '@inproceedings{Fahl_Harbach_Acar_Smith_2013, title={On the ecological validity
of a password study}, DOI={10.1145/2501604.2501617},
booktitle={Proceedings of the Ninth Symposium on Usable Privacy and Security},
publisher={ACM}, author={Fahl, Sascha and Harbach, Marian and Acar, Yasemin and
Smith, Matthew}, year={2013} }'
chicago: Fahl, Sascha, Marian Harbach, Yasemin Acar, and Matthew Smith. “On the
Ecological Validity of a Password Study.” In Proceedings of the Ninth Symposium
on Usable Privacy and Security. ACM, 2013. https://doi.org/10.1145/2501604.2501617.
ieee: 'S. Fahl, M. Harbach, Y. Acar, and M. Smith, “On the ecological validity of
a password study,” 2013, doi: 10.1145/2501604.2501617.'
mla: Fahl, Sascha, et al. “On the Ecological Validity of a Password Study.” Proceedings
of the Ninth Symposium on Usable Privacy and Security, ACM, 2013, doi:10.1145/2501604.2501617.
short: 'S. Fahl, M. Harbach, Y. Acar, M. Smith, in: Proceedings of the Ninth Symposium
on Usable Privacy and Security, ACM, 2013.'
date_created: 2023-09-22T11:49:19Z
date_updated: 2024-06-05T13:17:57Z
department:
- _id: '34'
- _id: '858'
doi: 10.1145/2501604.2501617
extern: '1'
language:
- iso: eng
publication: Proceedings of the Ninth Symposium on Usable Privacy and Security
publication_status: published
publisher: ACM
status: public
title: On the ecological validity of a password study
type: conference
user_id: '14931'
year: '2013'
...