---
_id: '20'
abstract:
- lang: eng
text: "Approximate computing has shown to provide new ways to improve performance\r\nand
power consumption of error-resilient applications. While many of these\r\napplications
can be found in image processing, data classification or machine\r\nlearning,
we demonstrate its suitability to a problem from scientific\r\ncomputing. Utilizing
the self-correcting behavior of iterative algorithms, we\r\nshow that approximate
computing can be applied to the calculation of inverse\r\nmatrix p-th roots which
are required in many applications in scientific\r\ncomputing. Results show great
opportunities to reduce the computational effort\r\nand bandwidth required for
the execution of the discussed algorithm, especially\r\nwhen targeting special
accelerator hardware."
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Lass M, Kühne T, Plessl C. Using Approximate Computing for the Calculation
of Inverse Matrix p-th Roots. Embedded Systems Letters. 2018;10(2):33-36.
doi:10.1109/LES.2017.2760923
apa: Lass, M., Kühne, T., & Plessl, C. (2018). Using Approximate Computing for
the Calculation of Inverse Matrix p-th Roots. Embedded Systems Letters,
10(2), 33–36. https://doi.org/10.1109/LES.2017.2760923
bibtex: '@article{Lass_Kühne_Plessl_2018, title={Using Approximate Computing for
the Calculation of Inverse Matrix p-th Roots}, volume={10}, DOI={10.1109/LES.2017.2760923},
number={2}, journal={Embedded Systems Letters}, publisher={IEEE}, author={Lass,
Michael and Kühne, Thomas and Plessl, Christian}, year={2018}, pages={33–36} }'
chicago: 'Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate
Computing for the Calculation of Inverse Matrix P-Th Roots.” Embedded Systems
Letters 10, no. 2 (2018): 33–36. https://doi.org/10.1109/LES.2017.2760923.'
ieee: M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing for the Calculation
of Inverse Matrix p-th Roots,” Embedded Systems Letters, vol. 10, no. 2,
pp. 33–36, 2018.
mla: Lass, Michael, et al. “Using Approximate Computing for the Calculation of Inverse
Matrix P-Th Roots.” Embedded Systems Letters, vol. 10, no. 2, IEEE, 2018,
pp. 33–36, doi:10.1109/LES.2017.2760923.
short: M. Lass, T. Kühne, C. Plessl, Embedded Systems Letters 10 (2018) 33–36.
date_created: 2017-07-25T14:41:08Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '27'
- _id: '518'
- _id: '304'
doi: 10.1109/LES.2017.2760923
external_id:
arxiv:
- '1703.02283'
intvolume: ' 10'
issue: '2'
language:
- iso: eng
page: ' 33-36'
project:
- _id: '32'
grant_number: PL 595/2-1
name: Performance and Efficiency in HPC with Custom Computing
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Embedded Systems Letters
publication_identifier:
eissn:
- 1943-0671
issn:
- 1943-0663
publication_status: published
publisher: IEEE
status: public
title: Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots
type: journal_article
user_id: '16153'
volume: 10
year: '2018'
...
---
_id: '20188'
author:
- first_name: Ivan
full_name: Habernal, Ivan
last_name: Habernal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Habernal I, Wachsmuth H, Gurevych I, Stein B. The Argument Reasoning Comprehension
Task: Identification and Reconstruction of Implicit Warrants. In: Proceedings
of the 16th Annual Conference of the North American Chapter of the Association
for Computational Linguistics: Human Language Technologies. ; 2018:1930–1940.'
apa: 'Habernal, I., Wachsmuth, H., Gurevych, I., & Stein, B. (2018). The Argument
Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants.
In Proceedings of the 16th Annual Conference of the North American Chapter
of the Association for Computational Linguistics: Human Language Technologies
(pp. 1930–1940).'
bibtex: '@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={The Argument
Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants},
booktitle={Proceedings of the 16th Annual Conference of the North American Chapter
of the Association for Computational Linguistics: Human Language Technologies},
author={Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno},
year={2018}, pages={1930–1940} }'
chicago: 'Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “The
Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit
Warrants.” In Proceedings of the 16th Annual Conference of the North American
Chapter of the Association for Computational Linguistics: Human Language Technologies,
1930–1940, 2018.'
ieee: 'I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “The Argument Reasoning
Comprehension Task: Identification and Reconstruction of Implicit Warrants,” in
Proceedings of the 16th Annual Conference of the North American Chapter of
the Association for Computational Linguistics: Human Language Technologies,
2018, pp. 1930–1940.'
mla: 'Habernal, Ivan, et al. “The Argument Reasoning Comprehension Task: Identification
and Reconstruction of Implicit Warrants.” Proceedings of the 16th Annual Conference
of the North American Chapter of the Association for Computational Linguistics:
Human Language Technologies, 2018, pp. 1930–1940.'
short: 'I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of the
16th Annual Conference of the North American Chapter of the Association for Computational
Linguistics: Human Language Technologies, 2018, pp. 1930–1940.'
date_created: 2020-10-23T16:46:30Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '600'
language:
- iso: eng
page: 1930–1940
publication: 'Proceedings of the 16th Annual Conference of the North American Chapter
of the Association for Computational Linguistics: Human Language Technologies'
status: public
title: 'The Argument Reasoning Comprehension Task: Identification and Reconstruction
of Implicit Warrants'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '2831'
abstract:
- lang: eng
text: 'We consider a market where final products or services are compositions of
a number of basic services. Users are asked to evaluate the quality of the composed
product after purchase. The quality of the basic service influences the performance
of the composed services but cannot be observed directly. The question we pose
is whether it is possible to use user evaluations on composed services to assess
the quality of basic services. We discuss how to combine aggregation of evaluations
across users and disaggregation of information on composed services to derive
valuations for the single components. As a solution we propose to use the (weighted)
average as aggregation device in connection with the Shapley value as disaggregation
method, since this combination fulfills natural requirements in our context. In
addition, we address some occurring computational issues: We give an approximate
solution concept using only a limited number of evaluations which guarantees nearly
optimal results with reduced running time. Lastly, we show that a slightly modified
Shapley value and the weighted average are still applicable if the evaluation
profiles are incomplete.'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
- first_name: Nadja
full_name: Stroh-Maraun, Nadja
id: '13264'
last_name: Stroh-Maraun
citation:
ama: 'Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations
Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics
of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659'
apa: Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating
User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6).
Irvine, California, USA. https://doi.org/10.1145/3230654.3230659
bibtex: '@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating
User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659},
booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen
and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6}
}'
chicago: Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun.
“Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of
the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018),
5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.
ieee: M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating
User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine,
California, USA, 2018, pp. 5:1-5:6.
mla: Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley
Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
short: 'M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings
of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon
2018), 2018, pp. 5:1-5:6.'
conference:
end_date: 2018-06-18
location: Irvine, California, USA
name: The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon
2018)
start_date: 2018-06-18
date_created: 2018-05-22T10:28:51Z
date_updated: 2022-01-06T06:58:01Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
- _id: '205'
- _id: '475'
doi: 10.1145/3230654.3230659
file:
- access_level: closed
content_type: application/pdf
creator: nmaraun
date_created: 2018-08-15T07:30:50Z
date_updated: 2018-08-15T07:30:50Z
file_id: '3910'
file_name: Disaggregating User Evaluations Using the Shapley Value.pdf
file_size: 1450171
relation: main_file
success: 1
file_date_updated: 2018-08-15T07:30:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 5:1-5:6
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Proceedings of the 13th Workshop on Economics of Networks, Systems and
Computation (NetEcon 2018)
publication_identifier:
isbn:
- 978-1-4503-5916-0
publication_status: published
status: public
title: Disaggregating User Evaluations Using the Shapley Value
type: conference
user_id: '14052'
year: '2018'
...
---
_id: '2848'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online
Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y
apa: Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible
Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574.
https://doi.org/10.1007/s00453-018-0420-y
bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y},
number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei
and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574}
}'
chicago: 'Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards
Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5
(2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.'
ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574,
2018.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
short: S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
date_created: 2018-05-24T08:32:38Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00453-018-0420-y
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:18:16Z
date_updated: 2018-11-02T15:18:16Z
file_id: '5298'
file_name: TowardsFlexibleDemandsInOnline.pdf
file_size: 600583
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:18:16Z
has_accepted_license: '1'
intvolume: ' 80'
issue: '5'
language:
- iso: eng
page: 1556–1574
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Algorithmica
publisher: Springer
status: public
title: 'Towards Flexible Demands in Online Leasing Problems. '
type: journal_article
user_id: '477'
volume: 80
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
DOI={10.1007/s00224-017-9836-z},
journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2018} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
Theory of Computing Systems, 2018.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems,
Springer, 2018, doi:10.1007/s00224-017-9836-z.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:24:32Z
date_updated: 2018-11-02T15:24:32Z
file_id: '5301'
file_name: ApproximationAndHeuristicAlgor.pdf
file_size: 1371624
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:24:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theory of Computing Systems
publication_identifier:
unknown:
- 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '2850'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
citation:
ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive:
Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018.
doi:10.4230/LIPIcs.FUN.2018.22'
apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018).
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms
(FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22'
bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected
Dominating Sets}, DOI={10.4230/LIPIcs.FUN.2018.22},
booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
year={2018} }'
chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
Mostafa Wahby. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse
Based on Online Connected Dominating Sets.” In Ninth International Conference
on Fun with Algorithms (FUN), 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.22.'
ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
& Survive: Charging Robots in a Modern Warehouse based on Online Connected
Dominating Sets,” in Ninth International Conference on Fun with Algorithms
(FUN), 2018.'
mla: 'Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern
Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference
on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.'
short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-13T13:15:19Z
date_updated: 2018-11-13T13:15:19Z
file_id: '5536'
file_name: LIPIcs-FUN-2018-22.pdf
file_size: 554298
relation: main_file
success: 1
file_date_updated: 2018-11-13T13:15:19Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '2857'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning.
In: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning. AAAI;
2018:31-39.'
apa: 'Mohr, F., Lettmann, T., Hüllermeier, E., & Wever, M. D. (2018). Programmatic
Task Network Planning. In Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning (pp. 31–39). Delft, Netherlands: AAAI.'
bibtex: '@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic
Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier,
Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }'
chicago: Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever.
“Programmatic Task Network Planning.” In Proceedings of the 1st ICAPS Workshop
on Hierarchical Planning, 31–39. AAAI, 2018.
ieee: F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task
Network Planning,” in Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning, Delft, Netherlands, 2018, pp. 31–39.
mla: Mohr, Felix, et al. “Programmatic Task Network Planning.” Proceedings of
the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.
short: 'F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the
1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.'
conference:
end_date: 2018-06-29
location: Delft, Netherlands
name: 28th International Conference on Automated Planning and Scheduling
start_date: 2018-06-24
date_created: 2018-05-24T09:00:20Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:18:26Z
date_updated: 2018-11-06T15:18:26Z
file_id: '5384'
file_name: Mohr18ProgrammaticPlanning.pdf
file_size: 349958
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:18:26Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf
oa: '1'
page: 31-39
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning
publisher: AAAI
status: public
title: Programmatic Task Network Planning
type: conference
user_id: '315'
year: '2018'
...
---
_id: '2862'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings.
Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25'
apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and
Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology
- {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings
(pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25'
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25},
booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
}'
chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
and Publicly Linkable Universally-Composable Reputation Systems.” In Topics
in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-76953-0_25.'
ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings,
San Francisco, CA, USA, 2018, pp. 470–490.
mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing,
2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
- The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
International Publishing, Cham, 2018, pp. 470–490.'
conference:
end_date: 2018-04-20
location: San Francisco, CA, USA
name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
Conference 2018
start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:45:40Z
date_updated: 2018-11-02T13:45:40Z
file_id: '5253'
file_name: PracticalAnonymousAndPubliclyL.pdf
file_size: 3371773
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
{RSA} Conference 2018, Proceedings
publication_identifier:
isbn:
- '9783319769523'
- '9783319769530'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '24150'
author:
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Shalabh
full_name: Bhatnagar, Shalabh
last_name: Bhatnagar
citation:
ama: Ramaswamy A, Bhatnagar S. Stability of stochastic approximations with “controlled
markov” noise and temporal difference learning. IEEE Transactions on Automatic
Control. 2018;64(6):2614-2620.
apa: Ramaswamy, A., & Bhatnagar, S. (2018). Stability of stochastic approximations
with “controlled markov” noise and temporal difference learning. IEEE Transactions
on Automatic Control, 64(6), 2614–2620.
bibtex: '@article{Ramaswamy_Bhatnagar_2018, title={Stability of stochastic approximations
with “controlled markov” noise and temporal difference learning}, volume={64},
number={6}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE},
author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2018}, pages={2614–2620}
}'
chicago: 'Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic
Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.”
IEEE Transactions on Automatic Control 64, no. 6 (2018): 2614–20.'
ieee: A. Ramaswamy and S. Bhatnagar, “Stability of stochastic approximations with
‘controlled markov’ noise and temporal difference learning,” IEEE Transactions
on Automatic Control, vol. 64, no. 6, pp. 2614–2620, 2018.
mla: Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations
with ‘Controlled Markov’ Noise and Temporal Difference Learning.” IEEE Transactions
on Automatic Control, vol. 64, no. 6, IEEE, 2018, pp. 2614–20.
short: A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 64 (2018)
2614–2620.
date_created: 2021-09-10T10:17:54Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '355'
intvolume: ' 64'
issue: '6'
language:
- iso: eng
page: 2614-2620
publication: IEEE Transactions on Automatic Control
publisher: IEEE
status: public
title: Stability of stochastic approximations with “controlled markov” noise and temporal
difference learning
type: journal_article
user_id: '66937'
volume: 64
year: '2018'
...
---
_id: '24151'
author:
- first_name: Burak
full_name: Demirel, Burak
last_name: Demirel
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Daniel E
full_name: Quevedo, Daniel E
last_name: Quevedo
- first_name: Holger
full_name: Karl, Holger
last_name: Karl
citation:
ama: 'Demirel B, Ramaswamy A, Quevedo DE, Karl H. Deepcas: A deep reinforcement
learning algorithm for control-aware scheduling. IEEE Control Systems Letters.
2018;2(4):737-742.'
apa: 'Demirel, B., Ramaswamy, A., Quevedo, D. E., & Karl, H. (2018). Deepcas:
A deep reinforcement learning algorithm for control-aware scheduling. IEEE
Control Systems Letters, 2(4), 737–742.'
bibtex: '@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={Deepcas: A deep reinforcement
learning algorithm for control-aware scheduling}, volume={2}, number={4}, journal={IEEE
Control Systems Letters}, publisher={IEEE}, author={Demirel, Burak and Ramaswamy,
Arunselvan and Quevedo, Daniel E and Karl, Holger}, year={2018}, pages={737–742}
}'
chicago: 'Demirel, Burak, Arunselvan Ramaswamy, Daniel E Quevedo, and Holger Karl.
“Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.”
IEEE Control Systems Letters 2, no. 4 (2018): 737–42.'
ieee: 'B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “Deepcas: A deep reinforcement
learning algorithm for control-aware scheduling,” IEEE Control Systems Letters,
vol. 2, no. 4, pp. 737–742, 2018.'
mla: 'Demirel, Burak, et al. “Deepcas: A Deep Reinforcement Learning Algorithm for
Control-Aware Scheduling.” IEEE Control Systems Letters, vol. 2, no. 4,
IEEE, 2018, pp. 737–42.'
short: B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Control Systems Letters
2 (2018) 737–742.
date_created: 2021-09-10T10:19:07Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '355'
intvolume: ' 2'
issue: '4'
language:
- iso: eng
page: 737-742
publication: IEEE Control Systems Letters
publisher: IEEE
status: public
title: 'Deepcas: A deep reinforcement learning algorithm for control-aware scheduling'
type: journal_article
user_id: '66937'
volume: 2
year: '2018'
...
---
_id: '24396'
abstract:
- lang: eng
text: 'We study the Online Prize-collecting Node-weighted Steiner Forest problem
(OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| =
n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of
k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF
asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected
(there is a path between s and t in H) or its associated penalty is paid. The
goal is to minimize the weight of H and the total penalties paid. The current
best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive
algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing
a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF,
which is optimal up to constant factor since OPC-NWSF has a randomized lower bound
of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies
an improvement for two special cases of OPC-NWSF, the Online Prize-collecting
Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner
Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one
of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently
best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log
^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized
\(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et
al. (FOCS 2013), respectively.'
author:
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
citation:
ama: 'Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA).
; 2018. doi:10.1007/978-3-319-94667-2_18'
apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).
https://doi.org/10.1007/978-3-319-94667-2_18
bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm
for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18},
booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian,
Christine}, year={2018} }'
chicago: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting
Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms
(IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.
ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.'
mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA),
2018, doi:10.1007/978-3-319-94667-2_18.
short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA),
Cham, 2018.'
date_created: 2021-09-14T12:23:29Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-94667-2_18
language:
- iso: eng
place: Cham
publication: International Workshop on Combinatorial Algorithms (IWOCA)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '2471'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes.
In: SCC. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:10.1109/SCC.2018.00036'
apa: 'Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). On-The-Fly Service Construction
with Prototypes. In SCC. San Francisco, CA, USA: IEEE Computer Society.
https://doi.org/10.1109/SCC.2018.00036'
bibtex: '@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA},
title={On-The-Fly Service Construction with Prototypes}, DOI={10.1109/SCC.2018.00036},
booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever,
Marcel Dominik and Hüllermeier, Eyke}, year={2018} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service
Construction with Prototypes.” In SCC. San Francisco, CA, USA: IEEE Computer
Society, 2018. https://doi.org/10.1109/SCC.2018.00036.'
ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction
with Prototypes,” in SCC, San Francisco, CA, USA, 2018.
mla: Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” SCC,
IEEE Computer Society, 2018, doi:10.1109/SCC.2018.00036.
short: 'F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San
Francisco, CA, USA, 2018.'
conference:
end_date: 2018-07-07
location: San Francisco, CA, USA
name: IEEE International Conference on Services Computing, SCC 2018
start_date: 2018-07-02
date_created: 2018-04-23T11:40:20Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/SCC.2018.00036
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:15:38Z
date_updated: 2018-11-06T15:15:38Z
file_id: '5383'
file_name: 08456422.pdf
file_size: 356132
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:15:38Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ieeexplore.ieee.org/abstract/document/8456422
oa: '1'
place: San Francisco, CA, USA
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: SCC
publisher: IEEE Computer Society
status: public
title: On-The-Fly Service Construction with Prototypes
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '2472'
author:
- first_name: Sébastien
full_name: Auroux, Sébastien
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Karl H. Distributed Placement of Virtualized Control Applications
in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC); 2018. doi:
10.1109/WCNC.2018.8377335'
apa: Auroux, S., & Karl, H. (2018). Distributed Placement of Virtualized Control
Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC). https://doi.org/
10.1109/WCNC.2018.8377335
bibtex: '@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks}, DOI={ 10.1109/WCNC.2018.8377335}, publisher={Proc. of
IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux,
Sébastien and Karl, Holger}, year={2018} }'
chicago: Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018. https://doi.org/
10.1109/WCNC.2018.8377335.
ieee: S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications
in Mobile Backhaul Networks,” 2018.
mla: Auroux, Sébastien, and Holger Karl. Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018, doi:
10.1109/WCNC.2018.8377335.
short: 'S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC), 2018.'
date_created: 2018-04-24T08:04:28Z
date_updated: 2022-01-06T06:56:33Z
ddc:
- '000'
department:
- _id: '75'
doi: ' 10.1109/WCNC.2018.8377335'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-24T08:04:02Z
date_updated: 2018-04-24T08:04:02Z
file_id: '2473'
file_name: p2262-auroux.pdf
file_size: 371352
relation: main_file
success: 1
file_date_updated: 2018-04-24T08:04:02Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publisher: Proc. of IEEE Wireless Communications and Networking Conference (WCNC)
status: public
title: Distributed Placement of Virtualized Control Applications in Mobile Backhaul
Networks
type: conference
user_id: '126'
year: '2018'
...
---
_id: '26421'
author:
- first_name: Felix
full_name: Winkelnkemper, Felix
id: '3117'
last_name: Winkelnkemper
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
citation:
ama: 'Winkelnkemper F, Keil R. MediaThing – A Learning Scenario Targeting on Research
Skills. In: Bastiaens T, Van Braak J, Brown M, eds. Proceedings of EdMedia:
World Conference on Educational Media and Technology. ; 2018:2397-2406.'
apa: 'Winkelnkemper, F., & Keil, R. (2018). MediaThing – A Learning Scenario
Targeting on Research Skills. In T. Bastiaens, J Van Braak, & M Brown (Eds.),
Proceedings of EdMedia: World Conference on Educational Media and Technology.
(pp. 2397–2406).'
bibtex: '@inproceedings{Winkelnkemper_Keil_2018, place={Amsterdam, Netherlands},
title={MediaThing – A Learning Scenario Targeting on Research Skills}, booktitle={Proceedings
of EdMedia: World Conference on Educational Media and Technology.}, author={Winkelnkemper,
Felix and Keil, Reinhard}, editor={Bastiaens, T and Van Braak, J and Brown, M},
year={2018}, pages={2397–2406} }'
chicago: 'Winkelnkemper, Felix, and Reinhard Keil. “MediaThing – A Learning Scenario
Targeting on Research Skills.” In Proceedings of EdMedia: World Conference
on Educational Media and Technology., edited by T Bastiaens, J Van Braak,
and M Brown, 2397–2406. Amsterdam, Netherlands, 2018.'
ieee: 'F. Winkelnkemper and R. Keil, “MediaThing – A Learning Scenario Targeting
on Research Skills,” in Proceedings of EdMedia: World Conference on Educational
Media and Technology., 2018, pp. 2397–2406.'
mla: 'Winkelnkemper, Felix, and Reinhard Keil. “MediaThing – A Learning Scenario
Targeting on Research Skills.” Proceedings of EdMedia: World Conference on
Educational Media and Technology., edited by T Bastiaens et al., 2018, pp.
2397–406.'
short: 'F. Winkelnkemper, R. Keil, in: T. Bastiaens, J Van Braak, M Brown (Eds.),
Proceedings of EdMedia: World Conference on Educational Media and Technology.,
Amsterdam, Netherlands, 2018, pp. 2397–2406.'
date_created: 2021-10-18T18:17:23Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: 'T '
full_name: 'Bastiaens, T '
last_name: Bastiaens
- first_name: ' J'
full_name: ' Van Braak, J'
last_name: ' Van Braak'
- first_name: ' M'
full_name: Brown, M
last_name: Brown
language:
- iso: eng
page: 2397-2406
place: Amsterdam, Netherlands
publication: 'Proceedings of EdMedia: World Conference on Educational Media and Technology.'
publication_status: published
status: public
title: MediaThing – A Learning Scenario Targeting on Research Skills
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '26422'
alternative_title:
- STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities
author:
- first_name: E.-M
full_name: Seng, E.-M
last_name: Seng
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Gudrun
full_name: Oevel, Gudrun
id: '14924'
last_name: Oevel
orcid: https://orcid.org/0000-0002-6396-9535
citation:
ama: 'Seng E-M, Keil R, Oevel G. studiolo communis. In: Seng E-M, Keil R, Oevel
G, eds. De Gruyter; 2018:1-5.'
apa: Seng, E.-M., Keil, R., & Oevel, G. (2018). studiolo communis (E.-M.
Seng, R. Keil, & G. Oevel, Eds.; pp. 1–5). De Gruyter.
bibtex: '@inproceedings{Seng_Keil_Oevel_2018, place={Berlin, Bosten}, title={studiolo
communis}, publisher={De Gruyter}, author={Seng, E.-M and Keil, Reinhard and Oevel,
Gudrun}, editor={Seng, E.-M and Keil, Reinhard and Oevel, G}, year={2018}, pages={1–5}
}'
chicago: 'Seng, E.-M, Reinhard Keil, and Gudrun Oevel. “Studiolo Communis.” edited
by E.-M Seng, Reinhard Keil, and G Oevel, 1–5. Berlin, Bosten: De Gruyter, 2018.'
ieee: E.-M. Seng, R. Keil, and G. Oevel, “studiolo communis,” 2018, pp. 1–5.
mla: Seng, E. M., et al. Studiolo Communis. Edited by E.-M Seng et al., De
Gruyter, 2018, pp. 1–5.
short: 'E.-M. Seng, R. Keil, G. Oevel, in: E.-M. Seng, R. Keil, G. Oevel (Eds.),
De Gruyter, Berlin, Bosten, 2018, pp. 1–5.'
date_created: 2021-10-18T18:23:28Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: E.-M
full_name: Seng, E.-M
last_name: Seng
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: G
full_name: ' Oevel, G'
last_name: ' Oevel'
language:
- iso: eng
page: 1-5
place: Berlin, Bosten
publication_status: published
publisher: De Gruyter
status: public
title: studiolo communis
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '26423'
alternative_title:
- STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities
author:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
citation:
ama: 'Keil R. Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r
die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses
in den Kulturwissenschaften. In: Seng E-M, Keil R, Oevel G, eds. De Gruyter;
2018.'
apa: Keil, R. (2018). Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk
f{\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des
Forschungsdiskurses in den Kulturwissenschaften (E.-M. Seng, R. Keil, &
G. Oevel, Eds.). De Gruyter.
bibtex: '@inproceedings{Keil_2018, place={Berlin, Bosten}, title={Unterst{\"u}tzung
kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r die Entwicklung digitaler Arbeitsumgebungen
zur Unterst{\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften}, publisher={De
Gruyter}, author={Keil, Reinhard}, editor={Seng, E.-M and Keil, Reinhard and
Oevel, G}, year={2018} }'
chicago: 'Keil, Reinhard. “Unterst{\"u}tzung Kontingenter Wissensarbeit. Ein Rahmenwerk
F{\"u}r Die Entwicklung Digitaler Arbeitsumgebungen Zur Unterst{\"u}tzung Des
Forschungsdiskurses in Den Kulturwissenschaften.” edited by E.-M Seng, Reinhard Keil,
and G Oevel. Berlin, Bosten: De Gruyter, 2018.'
ieee: R. Keil, “Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r
die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses
in den Kulturwissenschaften,” 2018.
mla: Keil, Reinhard. Unterst{\"u}tzung Kontingenter Wissensarbeit. Ein Rahmenwerk
F{\"u}r Die Entwicklung Digitaler Arbeitsumgebungen Zur Unterst{\"u}tzung Des
Forschungsdiskurses in Den Kulturwissenschaften. Edited by E.-M Seng et al.,
De Gruyter, 2018.
short: 'R. Keil, in: E.-M. Seng, R. Keil, G. Oevel (Eds.), De Gruyter, Berlin,
Bosten, 2018.'
date_created: 2021-10-18T18:26:49Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: E.-M
full_name: Seng, E.-M
last_name: Seng
- first_name: Reinhard
full_name: ' Keil, Reinhard'
last_name: ' Keil'
- first_name: G
full_name: Oevel, G
last_name: Oevel
language:
- iso: eng
place: Berlin, Bosten
publication_status: published
publisher: De Gruyter
status: public
title: Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r die Entwicklung
digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses in den
Kulturwissenschaften
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '26424'
author:
- first_name: ' E.-M'
full_name: Seng, E.-M
last_name: Seng
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Gudrun
full_name: Oevel, Gudrun
id: '14924'
last_name: Oevel
orcid: https://orcid.org/0000-0002-6396-9535
citation:
ama: Seng E.-M, Keil R, Oevel G. STUDIOLO. Kooperative Forschungsumgebungen
in Den EHumanities. De Gruyter; 2018.
apa: Seng, E.-M, Keil, R., & Oevel, G. (2018). STUDIOLO. Kooperative Forschungsumgebungen
in den eHumanities. De Gruyter.
bibtex: '@book{Seng_Keil_Oevel_2018, place={Berlin, Bosten}, title={STUDIOLO. Kooperative
Forschungsumgebungen in den eHumanities}, publisher={De Gruyter}, author={Seng, E.-M
and Keil, Reinhard and Oevel, Gudrun}, year={2018} }'
chicago: 'Seng, E.-M, Reinhard Keil, and Gudrun Oevel. STUDIOLO. Kooperative
Forschungsumgebungen in Den EHumanities. Berlin, Bosten: De Gruyter, 2018.'
ieee: 'E.-M Seng, R. Keil, and G. Oevel, STUDIOLO. Kooperative Forschungsumgebungen
in den eHumanities. Berlin, Bosten: De Gruyter, 2018.'
mla: Seng, E.-M, et al. STUDIOLO. Kooperative Forschungsumgebungen in Den EHumanities.
De Gruyter, 2018.
short: E.-M Seng, R. Keil, G. Oevel, STUDIOLO. Kooperative Forschungsumgebungen
in Den EHumanities, De Gruyter, Berlin, Bosten, 2018.
date_created: 2021-10-18T18:32:41Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
language:
- iso: eng
place: Berlin, Bosten
publication_status: published
publisher: De Gruyter
status: public
title: STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities
type: book
user_id: '71124'
year: '2018'
...
---
_id: '26425'
alternative_title:
- 'Paderborn Symposium on Data Science Education at School Level 2017: The Collected
Extended Abstracts'
author:
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Selke H. Data science in schools from the perspective of contextual informatics.
In: Biehler R, Budde L, Frischemeier D, et al., eds. Universit{\"a}tsbibliothek
Paderborn; 2018:107-109.'
apa: Selke, H. (2018). Data science in schools from the perspective of contextual
informatics (R. Biehler, L Budde, D. Frischemeier, B. Heinemann, S. Podworny,
C. Schulte, & T. Wassong, Eds.; pp. 107–109). Universit{\"a}tsbibliothek Paderborn.
bibtex: '@inproceedings{Selke_2018, place={Paderborn}, title={Data science in schools
from the perspective of contextual informatics}, publisher={Universit{\"a}tsbibliothek
Paderborn}, author={Selke, Harald}, editor={Biehler, R and Budde, L and Frischemeier,
D and Heinemann, B and Podworny, S and Schulte, Carsten and Wassong, T}, year={2018},
pages={107–109} }'
chicago: 'Selke, Harald. “Data Science in Schools from the Perspective of Contextual
Informatics.” edited by R Biehler, L Budde, D Frischemeier, B Heinemann, S Podworny,
Carsten Schulte, and T Wassong, 107–9. Paderborn: Universit{\"a}tsbibliothek Paderborn,
2018.'
ieee: H. Selke, “Data science in schools from the perspective of contextual informatics,”
2018, pp. 107–109.
mla: Selke, Harald. Data Science in Schools from the Perspective of Contextual
Informatics. Edited by R Biehler et al., Universit{\"a}tsbibliothek Paderborn,
2018, pp. 107–09.
short: 'H. Selke, in: R. Biehler, L Budde, D. Frischemeier, B. Heinemann, S. Podworny,
C. Schulte, T. Wassong (Eds.), Universit{\"a}tsbibliothek Paderborn, Paderborn,
2018, pp. 107–109.'
date_created: 2021-10-18T18:37:32Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
editor:
- first_name: R
full_name: Biehler, R
last_name: Biehler
- first_name: ' L'
full_name: Budde, L
last_name: Budde
- first_name: D
full_name: Frischemeier, D
last_name: Frischemeier
- first_name: B
full_name: Heinemann, B
last_name: Heinemann
- first_name: S
full_name: Podworny, S
last_name: Podworny
- first_name: Carsten
full_name: Schulte, Carsten
last_name: Schulte
- first_name: T
full_name: Wassong, T
last_name: Wassong
language:
- iso: eng
page: 107-109
place: Paderborn
publication_status: published
publisher: Universit{\"a}tsbibliothek Paderborn
status: public
title: Data science in schools from the perspective of contextual informatics
type: conference
user_id: '71124'
year: '2018'
...
---
_id: '2685'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms.
SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045
apa: Blömer, J., & Kohn, K. (2018). Voronoi Cells of Lattices with Respect to
Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry., 2(2),
314–338. https://doi.org/10.1137/17M1132045
bibtex: '@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect
to Arbitrary Norms}, volume={2}, DOI={10.1137/17M1132045},
number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer,
Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }'
chicago: 'Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry. 2, no.
2 (2018): 314–38. https://doi.org/10.1137/17M1132045.'
ieee: J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary
Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp.
314–338, 2018.
mla: Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry., vol.
2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.
short: J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018)
314–338.
date_created: 2018-05-08T09:18:54Z
date_updated: 2022-01-06T06:57:29Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
doi: 10.1137/17M1132045
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:22:55Z
date_updated: 2018-11-02T15:22:55Z
file_id: '5300'
file_name: 17m1132045.pdf
file_size: 1131048
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:22:55Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '2'
language:
- iso: eng
page: 314-338
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: SIAM Journal on Applied Algebra and Geometry.
publication_identifier:
eissn:
- 2470-6566
publication_status: epub_ahead
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: journal_article
user_id: '477'
volume: 2
year: '2018'
...
---
_id: '3217'
author:
- first_name: Burak
full_name: Demirel, Burak
last_name: Demirel
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
last_name: Ramaswamy
- first_name: Daniel
full_name: Quevedo, Daniel
last_name: Quevedo
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Demirel B, Ramaswamy A, Quevedo D, Karl H. DeepCAS: A Deep Reinforcement Learning
Algorithm for Control-Aware Scheduling. In: ; 2018. doi:10.1109/LCSYS.2018.2847721'
apa: 'Demirel, B., Ramaswamy, A., Quevedo, D., & Karl, H. (2018). DeepCAS: A
Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. https://doi.org/10.1109/LCSYS.2018.2847721'
bibtex: '@inproceedings{Demirel_Ramaswamy_Quevedo_Karl_2018, title={DeepCAS: A Deep
Reinforcement Learning Algorithm for Control-Aware Scheduling}, DOI={10.1109/LCSYS.2018.2847721},
author={Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel and Karl,
Holger}, year={2018} }'
chicago: 'Demirel, Burak, Arunselvan Ramaswamy, Daniel Quevedo, and Holger Karl.
“DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,”
2018. https://doi.org/10.1109/LCSYS.2018.2847721.'
ieee: 'B. Demirel, A. Ramaswamy, D. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement
Learning Algorithm for Control-Aware Scheduling,” 2018.'
mla: 'Demirel, Burak, et al. DeepCAS: A Deep Reinforcement Learning Algorithm
for Control-Aware Scheduling. 2018, doi:10.1109/LCSYS.2018.2847721.'
short: 'B. Demirel, A. Ramaswamy, D. Quevedo, H. Karl, in: 2018.'
date_created: 2018-06-13T10:26:23Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/LCSYS.2018.2847721
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-06-13T10:47:57Z
date_updated: 2018-06-13T10:47:57Z
file_id: '3218'
file_name: 1803.02998.pdf
file_size: 354166
relation: main_file
success: 1
file_date_updated: 2018-06-13T10:47:57Z
has_accepted_license: '1'
main_file_link:
- url: https://arxiv.org/pdf/1803.02998.pdf
project:
- _id: '24'
name: Netzgewahre Regelung & regelungsgewahre Netze
status: public
title: 'DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling'
type: conference
user_id: '126'
year: '2018'
...