---
_id: '16150'
author:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Hüllermeier E. Fuzzy sets in machine learning and data mining. Applied Soft
Computing Journal. 2011:1493-1505.
apa: Hüllermeier, E. (2011). Fuzzy sets in machine learning and data mining. Applied
Soft Computing Journal, 1493–1505.
bibtex: '@article{Hüllermeier_2011, title={Fuzzy sets in machine learning and data
mining}, journal={Applied Soft Computing Journal}, author={Hüllermeier, Eyke},
year={2011}, pages={1493–1505} }'
chicago: Hüllermeier, Eyke. “Fuzzy Sets in Machine Learning and Data Mining.” Applied
Soft Computing Journal, 2011, 1493–1505.
ieee: E. Hüllermeier, “Fuzzy sets in machine learning and data mining,” Applied
Soft Computing Journal, pp. 1493–1505, 2011.
mla: Hüllermeier, Eyke. “Fuzzy Sets in Machine Learning and Data Mining.” Applied
Soft Computing Journal, 2011, pp. 1493–505.
short: E. Hüllermeier, Applied Soft Computing Journal (2011) 1493–1505.
date_created: 2020-02-27T17:50:06Z
date_updated: 2022-01-06T06:52:44Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
page: 1493-1505
publication: Applied Soft Computing Journal
status: public
title: Fuzzy sets in machine learning and data mining
type: journal_article
user_id: '49109'
year: '2011'
...
---
_id: '16153'
author:
- first_name: Robin
full_name: Senge, Robin
last_name: Senge
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Senge R, Hüllermeier E. Top-down induction of fuzzy pattern trees. IEEE
Transactions on Fuzzy Systems. 2011;19(2):241-252.
apa: Senge, R., & Hüllermeier, E. (2011). Top-down induction of fuzzy pattern
trees. IEEE Transactions on Fuzzy Systems, 19(2), 241–252.
bibtex: '@article{Senge_Hüllermeier_2011, title={Top-down induction of fuzzy pattern
trees}, volume={19}, number={2}, journal={IEEE Transactions on Fuzzy Systems},
author={Senge, Robin and Hüllermeier, Eyke}, year={2011}, pages={241–252} }'
chicago: 'Senge, Robin, and Eyke Hüllermeier. “Top-down Induction of Fuzzy Pattern
Trees.” IEEE Transactions on Fuzzy Systems 19, no. 2 (2011): 241–52.'
ieee: R. Senge and E. Hüllermeier, “Top-down induction of fuzzy pattern trees,”
IEEE Transactions on Fuzzy Systems, vol. 19, no. 2, pp. 241–252, 2011.
mla: Senge, Robin, and Eyke Hüllermeier. “Top-down Induction of Fuzzy Pattern Trees.”
IEEE Transactions on Fuzzy Systems, vol. 19, no. 2, 2011, pp. 241–52.
short: R. Senge, E. Hüllermeier, IEEE Transactions on Fuzzy Systems 19 (2011) 241–252.
date_created: 2020-02-27T17:57:24Z
date_updated: 2022-01-06T06:52:44Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
intvolume: ' 19'
issue: '2'
language:
- iso: eng
page: 241-252
publication: IEEE Transactions on Fuzzy Systems
status: public
title: Top-down induction of fuzzy pattern trees
type: journal_article
user_id: '49109'
volume: 19
year: '2011'
...
---
_id: '16409'
abstract:
- lang: eng
text: "Given a set of n mobile robots in the d-dimensional Euclidean space, the
goal is to let them converge to a single not predefined point. The challenge is
that the robots are limited in their capabilities. Robots can, upon activation,
compute the positions of all other robots using an individual affine coordinate
system. The robots are indistinguishable, oblivious and may have different affine
coordinate systems. A very general discrete time model assumes that robots are
activated in arbitrary order. Further, the computation of a new target point may
happen much earlier than the movement, so that the movement is based on outdated
information about other robot's positions. Time is measured as the number of rounds,
where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg:
Convergence properties of gravitational algorithms in asynchronous robot systems],
the Center of Gravity is considered as target function, convergence was proven,
and the number of rounds needed for halving the diameter of the convex hull of
the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check
property of target functions that guarantee convergence and yields upper time
bounds. This property intuitively says that when a robot computes a new target
point, this point is significantly within the current axes aligned minimal box
containing all robots. This property holds, e.g., for the above-mentioned target
function, and improves the above O(n^2) to an asymptotically optimal O(n) upper
bound. Our technique also yields a constant time bound for a target function that
requires all robots having identical coordinate axes.\r\n"
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing
Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms
for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22012-8_52
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for
Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52},
booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas
and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing
Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence
Algorithms for Mobile Robots,” in Automata, Languages and Programming,
Berlin, Heidelberg, 2011.
mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms
for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming,
Berlin, Heidelberg, 2011.'
date_created: 2020-04-06T07:47:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22012-8_52
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783642220111'
- '9783642220128'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '13194'
author:
- first_name: K.
full_name: Dembczynski, K.
last_name: Dembczynski
- first_name: W.
full_name: Waegeman, W.
last_name: Waegeman
- 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: 'Dembczynski K, Waegeman W, Cheng W, Hüllermeier E. An exact algorithm for
F-measure maximization. In: In Proceedings NIPS-2011, 25th Annual Conference
on Neural Information Processing Systems, Granada, Spain. ; 2011.'
apa: Dembczynski, K., Waegeman, W., Cheng, W., & Hüllermeier, E. (2011). An
exact algorithm for F-measure maximization. In In Proceedings NIPS-2011, 25th
Annual Conference on Neural Information Processing Systems, Granada, Spain.
bibtex: '@inproceedings{Dembczynski_Waegeman_Cheng_Hüllermeier_2011, title={An exact
algorithm for F-measure maximization}, booktitle={In Proceedings NIPS-2011, 25th
Annual Conference on Neural Information Processing Systems, Granada, Spain}, author={Dembczynski,
K. and Waegeman, W. and Cheng, W. and Hüllermeier, Eyke}, year={2011} }'
chicago: Dembczynski, K., W. Waegeman, W. Cheng, and Eyke Hüllermeier. “An Exact
Algorithm for F-Measure Maximization.” In In Proceedings NIPS-2011, 25th Annual
Conference on Neural Information Processing Systems, Granada, Spain, 2011.
ieee: K. Dembczynski, W. Waegeman, W. Cheng, and E. Hüllermeier, “An exact algorithm
for F-measure maximization,” in In Proceedings NIPS-2011, 25th Annual Conference
on Neural Information Processing Systems, Granada, Spain, 2011.
mla: Dembczynski, K., et al. “An Exact Algorithm for F-Measure Maximization.” In
Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing
Systems, Granada, Spain, 2011.
short: 'K. Dembczynski, W. Waegeman, W. Cheng, E. Hüllermeier, in: In Proceedings
NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada,
Spain, 2011.'
date_created: 2019-09-12T14:45:38Z
date_updated: 2022-01-06T06:51:30Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
publication: In Proceedings NIPS-2011, 25th Annual Conference on Neural Information
Processing Systems, Granada, Spain
status: public
title: An exact algorithm for F-measure maximization
type: conference
user_id: '49109'
year: '2011'
...
---
_id: '13196'
author:
- first_name: J.
full_name: Fürnkranz, J.
last_name: Fürnkranz
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Fürnkranz J, Hüllermeier E. Learning from label preferences. In: Elomaa T,
Hollmen J, Mannila H, eds. In Proceedings DS-2011, 14th International Conference
on Discovery Science, Number 6926 in LNAI. Springer; 2011:2-17.'
apa: Fürnkranz, J., & Hüllermeier, E. (2011). Learning from label preferences.
In T. Elomaa, J. Hollmen, & H. Mannila (Eds.), in Proceedings DS-2011,
14th International Conference on Discovery Science, number 6926 in LNAI (pp.
2–17). Springer.
bibtex: '@inproceedings{Fürnkranz_Hüllermeier_2011, title={Learning from label preferences},
booktitle={in Proceedings DS-2011, 14th International Conference on Discovery
Science, number 6926 in LNAI}, publisher={Springer}, author={Fürnkranz, J. and
Hüllermeier, Eyke}, editor={Elomaa, T. and Hollmen, J. and Mannila, H.Editors},
year={2011}, pages={2–17} }'
chicago: Fürnkranz, J., and Eyke Hüllermeier. “Learning from Label Preferences.”
In In Proceedings DS-2011, 14th International Conference on Discovery Science,
Number 6926 in LNAI, edited by T. Elomaa, J. Hollmen, and H. Mannila, 2–17.
Springer, 2011.
ieee: J. Fürnkranz and E. Hüllermeier, “Learning from label preferences,” in in
Proceedings DS-2011, 14th International Conference on Discovery Science, number
6926 in LNAI, 2011, pp. 2–17.
mla: Fürnkranz, J., and Eyke Hüllermeier. “Learning from Label Preferences.” In
Proceedings DS-2011, 14th International Conference on Discovery Science, Number
6926 in LNAI, edited by T. Elomaa et al., Springer, 2011, pp. 2–17.
short: 'J. Fürnkranz, E. Hüllermeier, in: T. Elomaa, J. Hollmen, H. Mannila (Eds.),
In Proceedings DS-2011, 14th International Conference on Discovery Science, Number
6926 in LNAI, Springer, 2011, pp. 2–17.'
date_created: 2019-09-12T15:00:59Z
date_updated: 2022-01-06T06:51:30Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: T.
full_name: Elomaa, T.
last_name: Elomaa
- first_name: J.
full_name: Hollmen, J.
last_name: Hollmen
- first_name: H.
full_name: Mannila, H.
last_name: Mannila
language:
- iso: eng
page: 2-17
publication: in Proceedings DS-2011, 14th International Conference on Discovery Science,
number 6926 in LNAI
publisher: Springer
status: public
title: Learning from label preferences
type: conference
user_id: '49109'
year: '2011'
...
---
_id: '13197'
author:
- first_name: A.
full_name: Fallah Tehrani, A.
last_name: Fallah Tehrani
- first_name: W.
full_name: Cheng, W.
last_name: Cheng
- first_name: K.
full_name: Dembczynski, K.
last_name: Dembczynski
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Fallah Tehrani A, Cheng W, Dembczynski K, Hüllermeier E. Learning monotone
nonlinear models using the Choquet integral. In: In Proceedings ECML/PKDD-2011,
European Conference on Machine Learning and Principles and Practice of Knowledge
Discovery in Databases, Athens, Greece,. ; 2011.'
apa: Fallah Tehrani, A., Cheng, W., Dembczynski, K., & Hüllermeier, E. (2011).
Learning monotone nonlinear models using the Choquet integral. In In Proceedings
ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice
of Knowledge Discovery in Databases, Athens, Greece,.
bibtex: '@inproceedings{Fallah Tehrani_Cheng_Dembczynski_Hüllermeier_2011, title={Learning
monotone nonlinear models using the Choquet integral}, booktitle={In Proceedings
ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice
of Knowledge Discovery in Databases, Athens, Greece,}, author={Fallah Tehrani,
A. and Cheng, W. and Dembczynski, K. and Hüllermeier, Eyke}, year={2011} }'
chicago: Fallah Tehrani, A., W. Cheng, K. Dembczynski, and Eyke Hüllermeier. “Learning
Monotone Nonlinear Models Using the Choquet Integral.” In In Proceedings ECML/PKDD-2011,
European Conference on Machine Learning and Principles and Practice of Knowledge
Discovery in Databases, Athens, Greece, 2011.
ieee: A. Fallah Tehrani, W. Cheng, K. Dembczynski, and E. Hüllermeier, “Learning
monotone nonlinear models using the Choquet integral,” in In Proceedings ECML/PKDD-2011,
European Conference on Machine Learning and Principles and Practice of Knowledge
Discovery in Databases, Athens, Greece, 2011.
mla: Fallah Tehrani, A., et al. “Learning Monotone Nonlinear Models Using the Choquet
Integral.” In Proceedings ECML/PKDD-2011, European Conference on Machine Learning
and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,
2011.
short: 'A. Fallah Tehrani, W. Cheng, K. Dembczynski, E. Hüllermeier, in: In Proceedings
ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice
of Knowledge Discovery in Databases, Athens, Greece, 2011.'
date_created: 2019-09-12T15:04:58Z
date_updated: 2022-01-06T06:51:30Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
publication: In Proceedings ECML/PKDD-2011, European Conference on Machine Learning
and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,
status: public
title: Learning monotone nonlinear models using the Choquet integral
type: conference
user_id: '49109'
year: '2011'
...
---
_id: '13198'
author:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: P.
full_name: Schlegel, P.
last_name: Schlegel
citation:
ama: 'Hüllermeier E, Schlegel P. Preference-based CBR: First steps toward a methodological
framework. In: Ram A, Wiratunga N, eds. In Proceedings ICCBR-2011, 19th International
Conference on Case-Based Reasoning, Number 6880 in LNAI. Springer; 2011:77-91.'
apa: 'Hüllermeier, E., & Schlegel, P. (2011). Preference-based CBR: First steps
toward a methodological framework. In A. Ram & N. Wiratunga (Eds.), In
Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning,
number 6880 in LNAI (pp. 77–91). Springer.'
bibtex: '@inproceedings{Hüllermeier_Schlegel_2011, title={Preference-based CBR:
First steps toward a methodological framework}, booktitle={In Proceedings ICCBR-2011,
19th International Conference on Case-Based Reasoning, number 6880 in LNAI}, publisher={Springer},
author={Hüllermeier, Eyke and Schlegel, P.}, editor={Ram, A. and Wiratunga, N.Editors},
year={2011}, pages={77–91} }'
chicago: 'Hüllermeier, Eyke, and P. Schlegel. “Preference-Based CBR: First Steps
toward a Methodological Framework.” In In Proceedings ICCBR-2011, 19th International
Conference on Case-Based Reasoning, Number 6880 in LNAI, edited by A. Ram
and N. Wiratunga, 77–91. Springer, 2011.'
ieee: 'E. Hüllermeier and P. Schlegel, “Preference-based CBR: First steps toward
a methodological framework,” in In Proceedings ICCBR-2011, 19th International
Conference on Case-Based Reasoning, number 6880 in LNAI, 2011, pp. 77–91.'
mla: 'Hüllermeier, Eyke, and P. Schlegel. “Preference-Based CBR: First Steps toward
a Methodological Framework.” In Proceedings ICCBR-2011, 19th International
Conference on Case-Based Reasoning, Number 6880 in LNAI, edited by A. Ram
and N. Wiratunga, Springer, 2011, pp. 77–91.'
short: 'E. Hüllermeier, P. Schlegel, in: A. Ram, N. Wiratunga (Eds.), In Proceedings
ICCBR-2011, 19th International Conference on Case-Based Reasoning, Number 6880
in LNAI, Springer, 2011, pp. 77–91.'
date_created: 2019-09-12T15:10:28Z
date_updated: 2022-01-06T06:51:30Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: A.
full_name: Ram, A.
last_name: Ram
- first_name: N.
full_name: Wiratunga, N.
last_name: Wiratunga
language:
- iso: eng
page: 77-91
publication: In Proceedings ICCBR-2011, 19th International Conference on Case-Based
Reasoning, number 6880 in LNAI
publisher: Springer
status: public
title: 'Preference-based CBR: First steps toward a methodological framework'
type: conference
user_id: '49109'
year: '2011'
...
---
_id: '13588'
author:
- first_name: W.
full_name: Kotlowski, W.
last_name: Kotlowski
- first_name: K.
full_name: Dembczynski, K.
last_name: Dembczynski
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Kotlowski W, Dembczynski K, Hüllermeier E. Bipartite ranking through minimization
of univariate loss. In: In Proceedings ICML-2011, 28th International Conference
on Machine Learning, Washington, USA. ; 2011.'
apa: Kotlowski, W., Dembczynski, K., & Hüllermeier, E. (2011). Bipartite ranking
through minimization of univariate loss. In in Proceedings ICML-2011, 28th
International Conference on Machine Learning, Washington, USA.
bibtex: '@inproceedings{Kotlowski_Dembczynski_Hüllermeier_2011, title={Bipartite
ranking through minimization of univariate loss}, booktitle={in Proceedings ICML-2011,
28th International Conference on Machine Learning, Washington, USA}, author={Kotlowski,
W. and Dembczynski, K. and Hüllermeier, Eyke}, year={2011} }'
chicago: Kotlowski, W., K. Dembczynski, and Eyke Hüllermeier. “Bipartite Ranking
through Minimization of Univariate Loss.” In In Proceedings ICML-2011, 28th
International Conference on Machine Learning, Washington, USA, 2011.
ieee: W. Kotlowski, K. Dembczynski, and E. Hüllermeier, “Bipartite ranking through
minimization of univariate loss,” in in Proceedings ICML-2011, 28th International
Conference on Machine Learning, Washington, USA, 2011.
mla: Kotlowski, W., et al. “Bipartite Ranking through Minimization of Univariate
Loss.” In Proceedings ICML-2011, 28th International Conference on Machine Learning,
Washington, USA, 2011.
short: 'W. Kotlowski, K. Dembczynski, E. Hüllermeier, in: In Proceedings ICML-2011,
28th International Conference on Machine Learning, Washington, USA, 2011.'
date_created: 2019-10-02T16:21:06Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
publication: in Proceedings ICML-2011, 28th International Conference on Machine Learning,
Washington, USA
status: public
title: Bipartite ranking through minimization of univariate loss
type: conference
user_id: '49109'
year: '2011'
...
---
_id: '13643'
author:
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Enno
full_name: Lübbers, Enno
last_name: Lübbers
citation:
ama: 'Agne A, Platzner M, Lübbers E. Memory Virtualization for Multithreaded Reconfigurable
Hardware. In: Proceedings of the International Conference on Field Programmable
Logic and Applications (FPL). IEEE; 2011:185-188. doi:10.1109/fpl.2011.42'
apa: Agne, A., Platzner, M., & Lübbers, E. (2011). Memory Virtualization for
Multithreaded Reconfigurable Hardware. In Proceedings of the International
Conference on Field Programmable Logic and Applications (FPL) (pp. 185–188).
IEEE. https://doi.org/10.1109/fpl.2011.42
bibtex: '@inproceedings{Agne_Platzner_Lübbers_2011, title={Memory Virtualization
for Multithreaded Reconfigurable Hardware}, DOI={10.1109/fpl.2011.42},
booktitle={Proceedings of the International Conference on Field Programmable Logic
and Applications (FPL)}, publisher={IEEE}, author={Agne, Andreas and Platzner,
Marco and Lübbers, Enno}, year={2011}, pages={185–188} }'
chicago: Agne, Andreas, Marco Platzner, and Enno Lübbers. “Memory Virtualization
for Multithreaded Reconfigurable Hardware.” In Proceedings of the International
Conference on Field Programmable Logic and Applications (FPL), 185–88. IEEE,
2011. https://doi.org/10.1109/fpl.2011.42.
ieee: A. Agne, M. Platzner, and E. Lübbers, “Memory Virtualization for Multithreaded
Reconfigurable Hardware,” in Proceedings of the International Conference on
Field Programmable Logic and Applications (FPL), 2011, pp. 185–188.
mla: Agne, Andreas, et al. “Memory Virtualization for Multithreaded Reconfigurable
Hardware.” Proceedings of the International Conference on Field Programmable
Logic and Applications (FPL), IEEE, 2011, pp. 185–88, doi:10.1109/fpl.2011.42.
short: 'A. Agne, M. Platzner, E. Lübbers, in: Proceedings of the International Conference
on Field Programmable Logic and Applications (FPL), IEEE, 2011, pp. 185–188.'
date_created: 2019-10-04T22:42:51Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1109/fpl.2011.42
language:
- iso: eng
page: 185-188
publication: Proceedings of the International Conference on Field Programmable Logic
and Applications (FPL)
publication_identifier:
isbn:
- '9781457714849'
publication_status: published
publisher: IEEE
status: public
title: Memory Virtualization for Multithreaded Reconfigurable Hardware
type: conference
user_id: '398'
year: '2011'
...
---
_id: '13644'
author:
- first_name: Jörg
full_name: Henkel, Jörg
last_name: Henkel
- first_name: Lars
full_name: Hedrich, Lars
last_name: Hedrich
- first_name: Andreas
full_name: Herkersdorf, Andreas
last_name: Herkersdorf
- first_name: Rüdiger
full_name: Kapitza, Rüdiger
last_name: Kapitza
- first_name: Daniel
full_name: Lohmann, Daniel
last_name: Lohmann
- first_name: Peter
full_name: Marwedel, Peter
last_name: Marwedel
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Wolfgang
full_name: Rosenstiel, Wolfgang
last_name: Rosenstiel
- first_name: Ulf
full_name: Schlichtmann, Ulf
last_name: Schlichtmann
- first_name: Olaf
full_name: Spinczyk, Olaf
last_name: Spinczyk
- first_name: Mehdi
full_name: Tahoori, Mehdi
last_name: Tahoori
- first_name: Lars
full_name: Bauer, Lars
last_name: Bauer
- first_name: Jürgen
full_name: Teich, Jürgen
last_name: Teich
- first_name: Norbert
full_name: Wehn, Norbert
last_name: Wehn
- first_name: Hans-Joachim
full_name: Wunderlich, Hans-Joachim
last_name: Wunderlich
- first_name: Joachim
full_name: Becker, Joachim
last_name: Becker
- first_name: Oliver
full_name: Bringmann, Oliver
last_name: Bringmann
- first_name: Uwe
full_name: Brinkschulte, Uwe
last_name: Brinkschulte
- first_name: Samarjit
full_name: Chakraborty, Samarjit
last_name: Chakraborty
- first_name: Michael
full_name: Engel, Michael
last_name: Engel
- first_name: Rolf
full_name: Ernst, Rolf
last_name: Ernst
- first_name: Hermann
full_name: Härtig, Hermann
last_name: Härtig
citation:
ama: 'Henkel J, Hedrich L, Herkersdorf A, et al. Design and architectures for dependable
embedded systems. In: Proceedings of the Seventh IEEE/ACM/IFIP International
Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS ’11.
; 2011. doi:10.1145/2039370.2039384'
apa: Henkel, J., Hedrich, L., Herkersdorf, A., Kapitza, R., Lohmann, D., Marwedel,
P., … Härtig, H. (2011). Design and architectures for dependable embedded systems.
In Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software
Codesign and system synthesis - CODES+ISSS ’11. https://doi.org/10.1145/2039370.2039384
bibtex: '@inproceedings{Henkel_Hedrich_Herkersdorf_Kapitza_Lohmann_Marwedel_Platzner_Rosenstiel_Schlichtmann_Spinczyk_et
al._2011, title={Design and architectures for dependable embedded systems}, DOI={10.1145/2039370.2039384}, booktitle={Proceedings
of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign
and system synthesis - CODES+ISSS ’11}, author={Henkel, Jörg and Hedrich, Lars
and Herkersdorf, Andreas and Kapitza, Rüdiger and Lohmann, Daniel and Marwedel,
Peter and Platzner, Marco and Rosenstiel, Wolfgang and Schlichtmann, Ulf and Spinczyk,
Olaf and et al.}, year={2011} }'
chicago: Henkel, Jörg, Lars Hedrich, Andreas Herkersdorf, Rüdiger Kapitza, Daniel
Lohmann, Peter Marwedel, Marco Platzner, et al. “Design and Architectures for
Dependable Embedded Systems.” In Proceedings of the Seventh IEEE/ACM/IFIP International
Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS ’11,
2011. https://doi.org/10.1145/2039370.2039384.
ieee: J. Henkel et al., “Design and architectures for dependable embedded
systems,” in Proceedings of the seventh IEEE/ACM/IFIP International Conference
on Hardware/software Codesign and system synthesis - CODES+ISSS ’11, 2011.
mla: Henkel, Jörg, et al. “Design and Architectures for Dependable Embedded Systems.”
Proceedings of the Seventh IEEE/ACM/IFIP International Conference on Hardware/Software
Codesign and System Synthesis - CODES+ISSS ’11, 2011, doi:10.1145/2039370.2039384.
short: 'J. Henkel, L. Hedrich, A. Herkersdorf, R. Kapitza, D. Lohmann, P. Marwedel,
M. Platzner, W. Rosenstiel, U. Schlichtmann, O. Spinczyk, M. Tahoori, L. Bauer,
J. Teich, N. Wehn, H.-J. Wunderlich, J. Becker, O. Bringmann, U. Brinkschulte,
S. Chakraborty, M. Engel, R. Ernst, H. Härtig, in: Proceedings of the Seventh
IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System
Synthesis - CODES+ISSS ’11, 2011.'
date_created: 2019-10-04T22:44:36Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1145/2039370.2039384
language:
- iso: eng
publication: Proceedings of the seventh IEEE/ACM/IFIP International Conference on
Hardware/software Codesign and system synthesis - CODES+ISSS '11
publication_identifier:
isbn:
- '9781450307154'
publication_status: published
status: public
title: Design and architectures for dependable embedded systems
type: conference
user_id: '398'
year: '2011'
...
---
_id: '1376'
author:
- first_name: Christian
full_name: Dannewitz, Christian
last_name: Dannewitz
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Martin
full_name: Dräxler, Martin
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dannewitz C, Biermann T, Dräxler M, Karl H. Complex Queries in P2P Networks
with Resource-Constrained Devices. Journal of Advances in Information Technology.
2011;2(1). doi:10.4304/jait.2.1.2-14
apa: Dannewitz, C., Biermann, T., Dräxler, M., & Karl, H. (2011). Complex Queries
in P2P Networks with Resource-Constrained Devices. Journal of Advances in Information
Technology, 2(1). https://doi.org/10.4304/jait.2.1.2-14
bibtex: '@article{Dannewitz_Biermann_Dräxler_Karl_2011, title={Complex Queries in
P2P Networks with Resource-Constrained Devices}, volume={2}, DOI={10.4304/jait.2.1.2-14},
number={1}, journal={Journal of Advances in Information Technology}, publisher={Engineering
and Technology Publishing}, author={Dannewitz, Christian and Biermann, Thorsten
and Dräxler, Martin and Karl, Holger}, year={2011} }'
chicago: Dannewitz, Christian, Thorsten Biermann, Martin Dräxler, and Holger Karl.
“Complex Queries in P2P Networks with Resource-Constrained Devices.” Journal
of Advances in Information Technology 2, no. 1 (2011). https://doi.org/10.4304/jait.2.1.2-14.
ieee: C. Dannewitz, T. Biermann, M. Dräxler, and H. Karl, “Complex Queries in P2P
Networks with Resource-Constrained Devices,” Journal of Advances in Information
Technology, vol. 2, no. 1, 2011.
mla: Dannewitz, Christian, et al. “Complex Queries in P2P Networks with Resource-Constrained
Devices.” Journal of Advances in Information Technology, vol. 2, no. 1,
Engineering and Technology Publishing, 2011, doi:10.4304/jait.2.1.2-14.
short: C. Dannewitz, T. Biermann, M. Dräxler, H. Karl, Journal of Advances in Information
Technology 2 (2011).
date_created: 2018-03-19T14:28:44Z
date_updated: 2022-01-06T06:51:43Z
department:
- _id: '75'
doi: 10.4304/jait.2.1.2-14
intvolume: ' 2'
issue: '1'
publication: Journal of Advances in Information Technology
publication_identifier:
issn:
- 1798-2340
publication_status: published
publisher: Engineering and Technology Publishing
status: public
title: Complex Queries in P2P Networks with Resource-Constrained Devices
type: journal_article
user_id: '15572'
volume: 2
year: '2011'
...
---
_id: '46401'
abstract:
- lang: eng
text: Exploratory Landscape Analysis subsumes a number of techniques employed to
obtain knowledge about the properties of an unknown optimization problem, especially
insofar as these properties are important for the performance of optimization
algorithms. Where in a first attempt, one could rely on high-level features designed
by experts, we approach the problem from a different angle here, namely by using
relatively cheap low-level computer generated features. Interestingly, very few
features are needed to separate the BBOB problem groups and also for relating
a problem to high-level, expert designed features, paving the way for automatic
algorithm selection.
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
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Claus
full_name: Weihs, Claus
last_name: Weihs
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
citation:
ama: 'Mersmann O, Bischl B, Trautmann H, Preuss M, Weihs C, Rudolph G. Exploratory
Landscape Analysis. In: Proceedings of the 13th Annual Conference on Genetic
and Evolutionary Computation. GECCO ’11. Association for Computing Machinery;
2011:829–836. doi:10.1145/2001576.2001690'
apa: Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., & Rudolph,
G. (2011). Exploratory Landscape Analysis. Proceedings of the 13th Annual Conference
on Genetic and Evolutionary Computation, 829–836. https://doi.org/10.1145/2001576.2001690
bibtex: '@inproceedings{Mersmann_Bischl_Trautmann_Preuss_Weihs_Rudolph_2011, place={New
York, NY, USA}, series={GECCO ’11}, title={Exploratory Landscape Analysis}, DOI={10.1145/2001576.2001690}, booktitle={Proceedings
of the 13th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association
for Computing Machinery}, author={Mersmann, Olaf and Bischl, Bernd and Trautmann,
Heike and Preuss, Mike and Weihs, Claus and Rudolph, Günter}, year={2011}, pages={829–836},
collection={GECCO ’11} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs,
and Günter Rudolph. “Exploratory Landscape Analysis.” In Proceedings of the
13th Annual Conference on Genetic and Evolutionary Computation, 829–836. GECCO
’11. New York, NY, USA: Association for Computing Machinery, 2011. https://doi.org/10.1145/2001576.2001690.'
ieee: 'O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs, and G. Rudolph,
“Exploratory Landscape Analysis,” in Proceedings of the 13th Annual Conference
on Genetic and Evolutionary Computation, 2011, pp. 829–836, doi: 10.1145/2001576.2001690.'
mla: Mersmann, Olaf, et al. “Exploratory Landscape Analysis.” Proceedings of
the 13th Annual Conference on Genetic and Evolutionary Computation, Association
for Computing Machinery, 2011, pp. 829–836, doi:10.1145/2001576.2001690.
short: 'O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs, G. Rudolph, in:
Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation,
Association for Computing Machinery, New York, NY, USA, 2011, pp. 829–836.'
date_created: 2023-08-04T15:58:22Z
date_updated: 2023-10-16T13:54:34Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2001576.2001690
keyword:
- exploratory landscape analysis
- evolutionary optimization
- fitness landscape
- benchmarking
- BBOB test set
language:
- iso: eng
page: 829–836
place: New York, NY, USA
publication: Proceedings of the 13th Annual Conference on Genetic and Evolutionary
Computation
publication_identifier:
isbn:
- '9781450305570'
publisher: Association for Computing Machinery
series_title: GECCO ’11
status: public
title: Exploratory Landscape Analysis
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '46402'
abstract:
- lang: eng
text: The use of multi-objective evolutionary algorithms for solving black-box problems
with multiple conflicting objectives has become an important research area. However,
when no gradient information is available, the examination of formal convergence
or optimality criteria is often impossible. Thus, sophisticated heuristic online
stopping criteria (OSC) have recently become subject of intensive research. In
order to establish formal guidelines for a systematic research, we present a taxonomy
of OSC in this paper. We integrate the known approaches within the taxonomy and
discuss them by extracting their building blocks. The formal structure of the
taxonomy is used as a basis for the implementation of a comprehensive MATLAB toolbox.
Both contributions, the formal taxonomy and the MATLAB implementation, provide
a framework for the analysis and evaluation of existing and new OSC approaches.
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: Luis
full_name: Martí, Luis
last_name: Martí
citation:
ama: 'Wagner T, Trautmann H, Martí L. A Taxonomy of Online Stopping Criteria for
Multi-Objective Evolutionary Algorithms. In: Takahashi RHC, Deb K, Wanner EF,
Greco S, eds. Evolutionary Multi-Criterion Optimization. Springer Berlin
Heidelberg; 2011:16–30. doi:https://doi.org/10.1007/978-3-642-19893-9_2'
apa: Wagner, T., Trautmann, H., & Martí, L. (2011). A Taxonomy of Online Stopping
Criteria for Multi-Objective Evolutionary Algorithms. In R. H. C. Takahashi, K.
Deb, E. F. Wanner, & S. Greco (Eds.), Evolutionary Multi-Criterion Optimization
(pp. 16–30). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-19893-9_2
bibtex: '@inproceedings{Wagner_Trautmann_Martí_2011, place={Berlin, Heidelberg},
title={A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary
Algorithms}, DOI={https://doi.org/10.1007/978-3-642-19893-9_2},
booktitle={Evolutionary Multi-Criterion Optimization}, publisher={Springer Berlin
Heidelberg}, author={Wagner, Tobias and Trautmann, Heike and Martí, Luis}, editor={Takahashi,
Ricardo H. C. and Deb, Kalyanmoy and Wanner, Elizabeth F. and Greco, Salvatore},
year={2011}, pages={16–30} }'
chicago: 'Wagner, Tobias, Heike Trautmann, and Luis Martí. “A Taxonomy of Online
Stopping Criteria for Multi-Objective Evolutionary Algorithms.” In Evolutionary
Multi-Criterion Optimization, edited by Ricardo H. C. Takahashi, Kalyanmoy
Deb, Elizabeth F. Wanner, and Salvatore Greco, 16–30. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-19893-9_2.'
ieee: 'T. Wagner, H. Trautmann, and L. Martí, “A Taxonomy of Online Stopping Criteria
for Multi-Objective Evolutionary Algorithms,” in Evolutionary Multi-Criterion
Optimization, 2011, pp. 16–30, doi: https://doi.org/10.1007/978-3-642-19893-9_2.'
mla: Wagner, Tobias, et al. “A Taxonomy of Online Stopping Criteria for Multi-Objective
Evolutionary Algorithms.” Evolutionary Multi-Criterion Optimization, edited
by Ricardo H. C. Takahashi et al., Springer Berlin Heidelberg, 2011, pp. 16–30,
doi:https://doi.org/10.1007/978-3-642-19893-9_2.
short: 'T. Wagner, H. Trautmann, L. Martí, in: R.H.C. Takahashi, K. Deb, E.F. Wanner,
S. Greco (Eds.), Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2011, pp. 16–30.'
date_created: 2023-08-04T15:59:18Z
date_updated: 2023-10-16T13:54:50Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1007/978-3-642-19893-9_2
editor:
- first_name: Ricardo H. C.
full_name: Takahashi, Ricardo H. C.
last_name: Takahashi
- first_name: Kalyanmoy
full_name: Deb, Kalyanmoy
last_name: Deb
- first_name: Elizabeth F.
full_name: Wanner, Elizabeth F.
last_name: Wanner
- first_name: Salvatore
full_name: Greco, Salvatore
last_name: Greco
language:
- iso: eng
page: 16–30
place: Berlin, Heidelberg
publication: Evolutionary Multi-Criterion Optimization
publication_identifier:
isbn:
- 978-3-642-19893-9
publisher: Springer Berlin Heidelberg
status: public
title: A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '46403'
abstract:
- lang: eng
text: ' Evolutionary (multi-objective optimization) algorithms (EMOAs) are widely
accepted to be competitive optimization methods in industry today. However, normally
only standard techniques are employed by the engineering experts. Here, it is
shown how these standard techniques can be completed and improved with respect
to interactivity to other tools, runtime, and parameterization. The coupling with
metamodels serves as an example for the interactivity to other tools, while the
online convergence detection relates to runtime, i.e. stopping criteria. Finally,
sequential parameter optimization improves results focussing on parameter tuning.
We show that invoking all these methods on their own already enhances EMOAs for
aerodynamic applications. It is concluded with an outlook on how these methods
might come together to foster aerospace applications and, at a time, widen the
application area to multi-disciplinary optimization tasks. '
author:
- first_name: B
full_name: Naujoks, B
last_name: Naujoks
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: S
full_name: Wessing, S
last_name: Wessing
- first_name: C
full_name: Weihs, C
last_name: Weihs
citation:
ama: 'Naujoks B, Trautmann H, Wessing S, Weihs C. Advanced concepts for multi-objective
evolutionary optimization in aircraft industry. Proceedings of the Institution
of Mechanical Engineers, Part G: Journal of Aerospace Engineering. 2011;225(10):1081-1096.
doi:10.1177/0954410011414120'
apa: 'Naujoks, B., Trautmann, H., Wessing, S., & Weihs, C. (2011). Advanced
concepts for multi-objective evolutionary optimization in aircraft industry. Proceedings
of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering,
225(10), 1081–1096. https://doi.org/10.1177/0954410011414120'
bibtex: '@article{Naujoks_Trautmann_Wessing_Weihs_2011, title={Advanced concepts
for multi-objective evolutionary optimization in aircraft industry}, volume={225},
DOI={10.1177/0954410011414120},
number={10}, journal={Proceedings of the Institution of Mechanical Engineers,
Part G: Journal of Aerospace Engineering}, author={Naujoks, B and Trautmann, Heike
and Wessing, S and Weihs, C}, year={2011}, pages={1081–1096} }'
chicago: 'Naujoks, B, Heike Trautmann, S Wessing, and C Weihs. “Advanced Concepts
for Multi-Objective Evolutionary Optimization in Aircraft Industry.” Proceedings
of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering
225, no. 10 (2011): 1081–96. https://doi.org/10.1177/0954410011414120.'
ieee: 'B. Naujoks, H. Trautmann, S. Wessing, and C. Weihs, “Advanced concepts for
multi-objective evolutionary optimization in aircraft industry,” Proceedings
of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering,
vol. 225, no. 10, pp. 1081–1096, 2011, doi: 10.1177/0954410011414120.'
mla: 'Naujoks, B., et al. “Advanced Concepts for Multi-Objective Evolutionary Optimization
in Aircraft Industry.” Proceedings of the Institution of Mechanical Engineers,
Part G: Journal of Aerospace Engineering, vol. 225, no. 10, 2011, pp. 1081–96,
doi:10.1177/0954410011414120.'
short: 'B. Naujoks, H. Trautmann, S. Wessing, C. Weihs, Proceedings of the Institution
of Mechanical Engineers, Part G: Journal of Aerospace Engineering 225 (2011) 1081–1096.'
date_created: 2023-08-04T16:00:28Z
date_updated: 2023-10-16T13:55:07Z
department:
- _id: '34'
- _id: '819'
doi: 10.1177/0954410011414120
intvolume: ' 225'
issue: '10'
language:
- iso: eng
page: 1081-1096
publication: 'Proceedings of the Institution of Mechanical Engineers, Part G: Journal
of Aerospace Engineering'
status: public
title: Advanced concepts for multi-objective evolutionary optimization in aircraft
industry
type: journal_article
user_id: '15504'
volume: 225
year: '2011'
...
---
_id: '2910'
author:
- first_name: Stefanie
full_name: ' Naewe, Stefanie'
id: '1971'
last_name: ' Naewe'
citation:
ama: Naewe S. Algorithms for Lattice Problems with Respect to General Norms.
Universität Paderborn; 2011.
apa: Naewe, S. (2011). Algorithms for lattice problems with respect to general
norms. Universität Paderborn.
bibtex: '@book{ Naewe_2011, title={Algorithms for lattice problems with respect
to general norms}, publisher={Universität Paderborn}, author={ Naewe, Stefanie},
year={2011} }'
chicago: Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General
Norms. Universität Paderborn, 2011.
ieee: S. Naewe, Algorithms for lattice problems with respect to general norms.
Universität Paderborn, 2011.
mla: Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General
Norms. Universität Paderborn, 2011.
short: S. Naewe, Algorithms for Lattice Problems with Respect to General Norms,
Universität Paderborn, 2011.
date_created: 2018-05-25T10:08:44Z
date_updated: 2024-08-08T12:17:02Z
department:
- _id: '64'
language:
- iso: eng
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8047
publication_status: published
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Algorithms for lattice problems with respect to general norms
type: dissertation
user_id: '49063'
year: '2011'
...
---
_id: '37001'
author:
- first_name: Markus
full_name: Becker, Markus
last_name: Becker
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Ahmed
full_name: Elfeky, Ahmed
last_name: Elfeky
citation:
ama: 'Becker M, Zabel H, Müller W, Elfeky A. Virtual Prototyping software-intensiver
mechatronischer Systeme - Eine Fallstudie. In: ; 2011.'
apa: Becker, M., Zabel, H., Müller, W., & Elfeky, A. (2011). Virtual Prototyping
software-intensiver mechatronischer Systeme - Eine Fallstudie. 8. Paderborner
Workshop Entwurf Mechatronischer Systeme.
bibtex: '@inproceedings{Becker_Zabel_Müller_Elfeky_2011, place={Paderborn}, title={Virtual
Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie}, author={Becker,
Markus and Zabel, Henning and Müller, Wolfgang and Elfeky, Ahmed}, year={2011}
}'
chicago: Becker, Markus, Henning Zabel, Wolfgang Müller, and Ahmed Elfeky. “Virtual
Prototyping Software-Intensiver Mechatronischer Systeme - Eine Fallstudie.” Paderborn,
2011.
ieee: M. Becker, H. Zabel, W. Müller, and A. Elfeky, “Virtual Prototyping software-intensiver
mechatronischer Systeme - Eine Fallstudie,” presented at the 8. Paderborner Workshop
Entwurf Mechatronischer Systeme, 2011.
mla: Becker, Markus, et al. Virtual Prototyping Software-Intensiver Mechatronischer
Systeme - Eine Fallstudie. 2011.
short: 'M. Becker, H. Zabel, W. Müller, A. Elfeky, in: Paderborn, 2011.'
conference:
name: 8. Paderborner Workshop Entwurf Mechatronischer Systeme
date_created: 2023-01-17T08:59:23Z
date_updated: 2023-01-17T08:59:47Z
department:
- _id: '672'
language:
- iso: eng
place: Paderborn
status: public
title: Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie
type: conference
user_id: '5786'
year: '2011'
...
---
_id: '37005'
author:
- first_name: Christoph
full_name: Kuznik, Christoph
last_name: Kuznik
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Kuznik C, Müller W. A SystemC Based Library for Functional Coverage. In: ;
2011.'
apa: Kuznik, C., & Müller, W. (2011). A SystemC Based Library for Functional
Coverage. Proceedings of the Design and Verification Conference (DVCON 2011),
San Jose, CA.
bibtex: '@inproceedings{Kuznik_Müller_2011, title={A SystemC Based Library for Functional
Coverage}, author={Kuznik, Christoph and Müller, Wolfgang}, year={2011} }'
chicago: Kuznik, Christoph, and Wolfgang Müller. “A SystemC Based Library for Functional
Coverage,” 2011.
ieee: C. Kuznik and W. Müller, “A SystemC Based Library for Functional Coverage,”
presented at the Proceedings of the Design and Verification Conference (DVCON
2011), San Jose, CA, 2011.
mla: Kuznik, Christoph, and Wolfgang Müller. A SystemC Based Library for Functional
Coverage. 2011.
short: 'C. Kuznik, W. Müller, in: 2011.'
conference:
location: San Jose, CA
name: Proceedings of the Design and Verification Conference (DVCON 2011)
date_created: 2023-01-17T09:05:48Z
date_updated: 2023-01-17T09:05:58Z
department:
- _id: '672'
language:
- iso: eng
status: public
title: A SystemC Based Library for Functional Coverage
type: conference
user_id: '5786'
year: '2011'
...
---
_id: '37006'
abstract:
- lang: eng
text: In this paper we present an approach for the configuration and reconfiguration
of FlexRay networks to increase their fault tolerance. To guarantee a correct
and deterministic system behavior, the FlexRay specification does not allow a
reconfiguration of the schedapproachule during run time. To avoid the necessity
of a complete bus restart in case of a node failure, we propose a reconfiguration
using redundant slots in the schedule and/or combine messages in existing frames
and slots, to compensate node failures and increase robustness. Our approach supports
the developer to increase the fault tolerance of the system during the design
phase. It is a heuristic, which, additionally to a determined initial configuration,
calculates possible reconfigurations for the remaining nodes of the FlexRay network
in case of a node failure, to keep the system working properly. An evaluation
by means of realistic safety-critical automotive real-time systems revealed that
it determines valid reconfigurations for up to 80% of possible individual node
failures. In summary, our approach offers major support for the developer of FlexRay
networks since the results provide helpful feedback about reconfiguration capabilities.
In an iterative design process these information can be used to determine and
optimize valid reconfigurations.
author:
- first_name: Kay
full_name: Klobedanz, Kay
last_name: Klobedanz
- first_name: Andreas
full_name: König, Andreas
last_name: König
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Klobedanz K, König A, Müller W. A Reconfiguration Approach for Faul-Tolerant
FlexRay Networks. In: Proceedings of DATE’11. IEEE; 2011. doi:10.1109/DATE.2011.5763022'
apa: Klobedanz, K., König, A., & Müller, W. (2011). A Reconfiguration Approach
for Faul-Tolerant FlexRay Networks. Proceedings of DATE’11. 2011 Design,
Automation & Test in Europe, Grenoble, France. https://doi.org/10.1109/DATE.2011.5763022
bibtex: '@inproceedings{Klobedanz_König_Müller_2011, place={Grenoble, France}, title={A
Reconfiguration Approach for Faul-Tolerant FlexRay Networks}, DOI={10.1109/DATE.2011.5763022},
booktitle={Proceedings of DATE’11}, publisher={IEEE}, author={Klobedanz, Kay and
König, Andreas and Müller, Wolfgang}, year={2011} }'
chicago: 'Klobedanz, Kay, Andreas König, and Wolfgang Müller. “A Reconfiguration
Approach for Faul-Tolerant FlexRay Networks.” In Proceedings of DATE’11.
Grenoble, France: IEEE, 2011. https://doi.org/10.1109/DATE.2011.5763022.'
ieee: 'K. Klobedanz, A. König, and W. Müller, “A Reconfiguration Approach for Faul-Tolerant
FlexRay Networks,” presented at the 2011 Design, Automation & Test in Europe,
Grenoble, France, 2011, doi: 10.1109/DATE.2011.5763022.'
mla: Klobedanz, Kay, et al. “A Reconfiguration Approach for Faul-Tolerant FlexRay
Networks.” Proceedings of DATE’11, IEEE, 2011, doi:10.1109/DATE.2011.5763022.
short: 'K. Klobedanz, A. König, W. Müller, in: Proceedings of DATE’11, IEEE, Grenoble,
France, 2011.'
conference:
location: Grenoble, France
name: 2011 Design, Automation & Test in Europe
date_created: 2023-01-17T09:09:25Z
date_updated: 2023-01-17T09:09:33Z
department:
- _id: '672'
doi: 10.1109/DATE.2011.5763022
keyword:
- Schedules
- Fault tolerant systems
- Redundancy
- Protocols
- Automotive engineering
- Genetic algorithms
language:
- iso: eng
place: Grenoble, France
publication: Proceedings of DATE'11
publisher: IEEE
status: public
title: A Reconfiguration Approach for Faul-Tolerant FlexRay Networks
type: conference
user_id: '5786'
year: '2011'
...
---
_id: '8178'
abstract:
- lang: eng
text: In [Piani et al., PRL106 (2011) 220403], an activation protocol was introduced
which maps the general non-classical (multipartite) correlations between given
systems into bipartite entanglement between the systems and local ancillae by
means of a potentially highly entangling interaction. Here, we study how this
activation protocol can be used to entangle the starting systems themselves via
entanglement swapping through a measurement on the ancillae. Furthermore, we bound
the relative entropy of quantumness (a naturally arising measure of non-classicality
in the scheme of Piani et al. above) for a special class of separable states,
the so-called classical–quantum states. In particular, we fully characterize the
classical–quantum two-qubit states that are maximally non-classical.
article_type: original
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: MARCO
full_name: PIANI, MARCO
last_name: PIANI
- first_name: GERARDO
full_name: ADESSO, GERARDO
last_name: ADESSO
- first_name: JOHN
full_name: CALSAMIGLIA, JOHN
last_name: CALSAMIGLIA
- first_name: PAWEŁ
full_name: HORODECKI, PAWEŁ
last_name: HORODECKI
citation:
ama: Gharibian S, PIANI M, ADESSO G, CALSAMIGLIA J, HORODECKI P. Characterizing
Quantumness via Entanglement Creation. International Journal of Quantum Information.
2011;09(07n08):1701-1713. doi:10.1142/s0219749911008258
apa: Gharibian, S., PIANI, M., ADESSO, G., CALSAMIGLIA, J., & HORODECKI, P.
(2011). Characterizing Quantumness via Entanglement Creation. International
Journal of Quantum Information, 09(07n08), 1701–1713. https://doi.org/10.1142/s0219749911008258
bibtex: '@article{Gharibian_PIANI_ADESSO_CALSAMIGLIA_HORODECKI_2011, title={Characterizing
Quantumness via Entanglement Creation}, volume={09}, DOI={10.1142/s0219749911008258},
number={07n08}, journal={International Journal of Quantum Information}, publisher={World
Scientific Pub Co Pte Lt}, author={Gharibian, Sevag and PIANI, MARCO and ADESSO,
GERARDO and CALSAMIGLIA, JOHN and HORODECKI, PAWEŁ}, year={2011}, pages={1701–1713}
}'
chicago: 'Gharibian, Sevag, MARCO PIANI, GERARDO ADESSO, JOHN CALSAMIGLIA, and PAWEŁ
HORODECKI. “Characterizing Quantumness via Entanglement Creation.” International
Journal of Quantum Information 09, no. 07n08 (2011): 1701–13. https://doi.org/10.1142/s0219749911008258.'
ieee: 'S. Gharibian, M. PIANI, G. ADESSO, J. CALSAMIGLIA, and P. HORODECKI, “Characterizing
Quantumness via Entanglement Creation,” International Journal of Quantum Information,
vol. 09, no. 07n08, pp. 1701–1713, 2011, doi: 10.1142/s0219749911008258.'
mla: Gharibian, Sevag, et al. “Characterizing Quantumness via Entanglement Creation.”
International Journal of Quantum Information, vol. 09, no. 07n08, World
Scientific Pub Co Pte Lt, 2011, pp. 1701–13, doi:10.1142/s0219749911008258.
short: S. Gharibian, M. PIANI, G. ADESSO, J. CALSAMIGLIA, P. HORODECKI, International
Journal of Quantum Information 09 (2011) 1701–1713.
date_created: 2019-03-01T12:08:55Z
date_updated: 2023-02-28T11:04:25Z
department:
- _id: '623'
- _id: '7'
doi: 10.1142/s0219749911008258
extern: '1'
external_id:
arxiv:
- '1105.3419'
intvolume: ' 9'
issue: 07n08
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1105.3419
oa: '1'
page: 1701-1713
publication: International Journal of Quantum Information
publication_identifier:
issn:
- 0219-7499
- 1793-6918
publication_status: published
publisher: World Scientific Pub Co Pte Lt
status: public
title: Characterizing Quantumness via Entanglement Creation
type: journal_article
user_id: '71541'
volume: '09'
year: '2011'
...
---
_id: '8176'
abstract:
- lang: eng
text: Approximation algorithms for classical constraint satisfaction problems are
one of the main research areas in theoretical computer science. Here we define
a natural approximation version of the QMA-complete local Hamiltonian problem
and initiate its study. We present two main results. The first shows that a non-trivial
approximation ratio can be obtained in the class NP using product states. The
second result (which builds on the first one), gives a polynomial time (classical)
algorithm providing a similar approximation ratio for dense instances of the problem.
The latter result is based on an adaptation of the "exhaustive sampling method"
by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting,
and might be of independent interest.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Julia
full_name: Kempe, Julia
last_name: Kempe
citation:
ama: 'Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems.
In: IEEE Annual Conference on Computational Complexity (CCC 2011). IEEE;
2011. doi:10.1109/ccc.2011.15'
apa: Gharibian, S., & Kempe, J. (2011). Approximation Algorithms for QMA-Complete
Problems. IEEE Annual Conference on Computational Complexity (CCC 2011).
2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose,
USA. https://doi.org/10.1109/ccc.2011.15
bibtex: '@inproceedings{Gharibian_Kempe_2011, title={Approximation Algorithms for
QMA-Complete Problems}, DOI={10.1109/ccc.2011.15},
booktitle={IEEE Annual Conference on Computational Complexity (CCC 2011)}, publisher={IEEE},
author={Gharibian, Sevag and Kempe, Julia}, year={2011} }'
chicago: Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete
Problems.” In IEEE Annual Conference on Computational Complexity (CCC 2011).
IEEE, 2011. https://doi.org/10.1109/ccc.2011.15.
ieee: 'S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,”
presented at the 2011 IEEE 26th Annual Conference on Computational Complexity
(CCC), San Jose, USA, 2011, doi: 10.1109/ccc.2011.15.'
mla: Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete
Problems.” IEEE Annual Conference on Computational Complexity (CCC 2011),
IEEE, 2011, doi:10.1109/ccc.2011.15.
short: 'S. Gharibian, J. Kempe, in: IEEE Annual Conference on Computational Complexity
(CCC 2011), IEEE, 2011.'
conference:
location: San Jose, USA
name: 2011 IEEE 26th Annual Conference on Computational Complexity (CCC)
date_created: 2019-03-01T12:06:18Z
date_updated: 2023-02-28T11:04:02Z
department:
- _id: '623'
- _id: '7'
doi: 10.1109/ccc.2011.15
extern: '1'
external_id:
arxiv:
- '1101.3884'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1101.3884
oa: '1'
publication: IEEE Annual Conference on Computational Complexity (CCC 2011)
publication_identifier:
isbn:
- '9781457701795'
publication_status: published
publisher: IEEE
status: public
title: Approximation Algorithms for QMA-Complete Problems
type: conference
user_id: '71541'
year: '2011'
...