Sebastian Zimmermann

dblp:33/11172 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 50% Performance modeling and evaluation · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
benchmarking
1.012026
Elevating AI on the Edge: A Demonstration of MIMaaS (Machine Intelligence with Microcontroller-as-a-Service) · AAAI 2026
Hardware accelerators and domain-specific architectures › edge accelerator
microcontroller inference
1.012026
Elevating AI on the Edge: A Demonstration of MIMaaS (Machine Intelligence with Microcontroller-as-a-Service) · AAAI 2026
YearPublicationVenuePosition
2026 Elevating AI on the Edge: A Demonstration of MIMaaS (Machine Intelligence with Microcontroller-as-a-Service)
abstract
Deploying AI on microcontrollers (MCUs) is challenging. We introduce MIMaaS, a Microcontroller-as-a-Service platform that enables users to upload a model, select a target device, and receive a detailed performance report remotely. A key innovation is our measurement of real-world power consumption, alongside latency and memory usage, directly from the physical hardware. MIMaaS empowers researchers and developers to easily create and validate hardware-aware AI models without needing physical hardware access.
Sebastian Zimmermann, René Groh, Andreas M. Kist
AAAI1
2002 Resource marking and fair rate allocation
abstract
In resource marking theory, users adapt their rates according to their utility functions and congestion signals from the network. Using a special type of utility function, this leads to a proportionally fair rate allocation among the users. We examine the ability of two proposed resource marking implementations, random exponential marking (see Athuraliya, S. et al., Teletraffic Science and Engineering, vol. 4, p.817-28, 2001) and the virtual queue mechanism (see Gibbens, R.J. and Kelly, F.P., Automatica, vol.35, p.1969-85, 1999), to yield a proportionally fair rate allocation. We also propose a third and less complex algorithm, single bit resource marking, that combines the advantages of both.
Sebastian Zimmermann, Ulrich Killat
ICC1