Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Michael Schaper"'
Autor:
Martin Avanzini, Michael Schaper
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 248, Iss Proc. DICE-FOPARA 2017, Pp 17-23 (2017)
In this extended abstract we present the GUBS Upper Bound Solver. GUBS is a dedicated constraint solver over the naturals for inequalities formed over uninterpreted function symbols and standard arithmetic operations. GUBS now forms the backbone of H
Externí odkaz:
https://doaj.org/article/02e2232b6c16421b8d470efa3200beeb
Autor:
Philipp Jordan, Bart Vonk, Jan-Christian Schmidt, Natasa Manojlovic, Michael Schaper, Peter Fröhle
Publikováno v:
Wasser und Abfall. 23:63-68
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 298:81-86
Autor:
Michael Schaper
Micro-, small- and medium-sized enterprises (SMEs) account for approximately 97 per cent of all active business entities within the ASEAN region. They are an important contributor to both emissions generation and future reduction. A recent large-scal
Autor:
Michael Schaper
There are at least 80–100 business associations (such as chambers of commerce or industry-specific bodies) in Malaysia today, representing over 600,000 firms. In February–April 2020, a range of chamber leaders and officers were interviewed to rec
Publikováno v:
Proceedings of OOPSLA 2020
OOPSLA 2020-Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020
OOPSLA 2020-Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020, Nov 2020, Chicago / Online, United States
OOPSLA 2020-Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020
OOPSLA 2020-Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020, Nov 2020, Chicago / Online, United States
We present a novel methodology for the automated resource analysis of non-deterministic, probabilistic imperative programs, which gives rise to a modular approach . Program fragments are analysed in full independence. Moreover, the established result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::024753ab323945dbfaf8f8be330f1317
https://inria.hal.science/hal-03013544/file/paper.pdf
https://inria.hal.science/hal-03013544/file/paper.pdf
Autor:
Michael Philipp, Michael Schaper
Publikováno v:
Debatten um die Souveränität
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1555a5385b897f288083bdde0fff010f
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/75296
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/75296
Autor:
Michael Schaper, Georg Moser
Publikováno v:
Information and Computation. 261:116-143
In this paper we show how the runtime complexity of imperative programs can be analysed fully automatically by a transformation to term rewrite systems, the complexity of which can then be automatically verified by existing complexity tools. We restr
Publikováno v:
Small Enterprise Research. 25:36-51
Conventional approaches to the study of SME finance tend to focus on the changing financing options and preferences as small businesses move through different stages. However, one of the limitation...
Autor:
Michael Schaper
Publikováno v:
Teaching Business Sustainability ISBN: 9781351281805
Teaching Business Sustainability: From Theory to Practice
Teaching Business Sustainability: From Theory to Practice
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b35a50d071679a59d0d38eb9460116f5
https://doi.org/10.4324/9781351281805-8
https://doi.org/10.4324/9781351281805-8