Zobrazeno 1 - 10
of 254
pro vyhledávání: '"Klaus-Dieter Schewe"'
Publikováno v:
Frontiers in Computer Science, Vol 4 (2022)
It is well-known that polylogarithmic space (PolyL for short) does not have complete problems under logarithmic space many-one reductions. Thus, we propose an alternative notion of completeness inspired by the concept of uniformity studied in circuit
Externí odkaz:
https://doaj.org/article/f6174c564ee84156bad4b320368ac624
Autor:
Klaus-Dieter Schewe
Publikováno v:
Frontiers in Computer Science, Vol 3 (2021)
Externí odkaz:
https://doaj.org/article/cad50d519c9c43baa467c5dcf2f12bbe
Autor:
Flavio Ferrarotti, Klaus-Dieter Schewe
Publikováno v:
Rigorous State-Based Methods ISBN: 9783031331626
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::448058ce126c48e1d6df6f5462f58f46
https://doi.org/10.1007/978-3-031-33163-3_18
https://doi.org/10.1007/978-3-031-33163-3_18
Publikováno v:
Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence.
Autor:
Egon Börger, Klaus-Dieter Schewe
Publikováno v:
Fundamenta Informaticae. 177:1-37
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deterministic) sequential algorithms axiomatically,
Autor:
Klaus-Dieter Schewe
Publikováno v:
Theoretical Aspects of Software Engineering ISBN: 9783031103629
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9594b274413f1bf0b96d50da5a8a58ad
https://doi.org/10.1007/978-3-031-10363-6_1
https://doi.org/10.1007/978-3-031-10363-6_1
Publikováno v:
Computer Languages, Systems & Structures. 54:297-315
Systems engineering concerns the complete process for the development of complex systems comprising hardware, software, facilities and personnel. Such systems are hybrid, as some components are characterized by continuous behavior, whereas the behavi
Publikováno v:
Rigorous State-Based Methods ISBN: 9783030775421
ABZ
ABZ
MapReduce supports the processing of large data sets in parallel. It has been shown that MapReduce is an example for the use of the bulk synchronous parallel (BSP) bridging model, a model for parallel computation on a fixed set of processors comprisi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::202d0e0bdb8b2c6fe9bad33646f2ebdc
https://doi.org/10.1007/978-3-030-77543-8_1
https://doi.org/10.1007/978-3-030-77543-8_1
Publikováno v:
Model and Data Engineering ISBN: 9783030784270
MEDI
MEDI
Choreographies prescribe the rendez-vous synchronisation of messages in a system of communicating finite state machines. Such a system is called realisable, if the traces of the prescribed communication coincide with those of the asynchronous system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9be2db617db64efea522d3ec55732078
https://doi.org/10.1007/978-3-030-78428-7_8
https://doi.org/10.1007/978-3-030-78428-7_8
Publikováno v:
Rigorous State-Based Methods ISBN: 9783030775421
ABZ
ABZ
The BSP bridging model can be exploited to support MapReduce processing. This article describes how this can be realised using a work-stealing approach, where an idle processor can autonomously grab a thread from a partially ordered pool of open thre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb6bd447baba86ba043aa40099de89df
https://doi.org/10.1007/978-3-030-77543-8_10
https://doi.org/10.1007/978-3-030-77543-8_10