More than 9990 Search Results for "Sim�on, J�r�me"

Volume

LIPIcs, Volume 274

31st Annual European Symposium on Algorithms (ESA 2023)

ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands

Editors: Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman

Volume

LIPIcs, Volume 238

28th International Conference on DNA Computing and Molecular Programming (DNA 28)

DNA 28, August 8-12, 2022, University of New Mexico, Albuquerque, New Mexico, USA

Editors: Thomas E. Ouldridge and Shelley F. J. Wickham

Volume

LIPIcs, Volume 205

27th International Conference on DNA Computing and Molecular Programming (DNA 27)

DNA 27, September 13-16, 2021, Oxford, UK (Virtual Conference)

Editors: Matthew R. Lakin and Petr Šulc

Volume

LIPIcs, Volume 202

46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)

MFCS 2021, August 23-27, 2021, Tallinn, Estonia

Editors: Filippo Bonchi and Simon J. Puglisi

Volume

OASIcs, Volume 82

2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020)

Tokenomics 2020, October 26-27, 2020, Toulouse, France

Editors: Emmanuelle Anceaume, Christophe Bisière, Matthieu Bouvard, Quentin Bramas, and Catherine Casamatta

Volume

LIPIcs, Volume 174

26th International Conference on DNA Computing and Molecular Programming (DNA 26)

DNA 26, September 14-17, 2020, Oxford, UK (Virtual Conference)

Editors: Cody Geary and Matthew J. Patitz

Volume

LIPIcs, Volume 119

27th EACSL Annual Conference on Computer Science Logic (CSL 2018)

CSL 2018, September 4-7, 2018, Birmingham, GB

Editors: Dan R. Ghica and Achim Jung

Volume

LIPIcs, Volume 93

37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)

FSTTCS 2017, December 11-15, 2017, Kanpur, India

Editors: Satya Lokam and R. Ramanujam

Volume

LIPIcs, Volume 75

16th International Symposium on Experimental Algorithms (SEA 2017)

SEA 2017, June 21-23, 2017, London, UK

Editors: Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, and Rajeev Raman

Volume

LIPIcs, Volume 77

33rd International Symposium on Computational Geometry (SoCG 2017)

SoCG 2017, July 4-7, 2017, Brisbane, Australia

Editors: Boris Aronov and Matthew J. Katz

Volume

OASIcs, Volume 47

15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015)

WCET 2015, July 7, 2015, Lund, Sweden

Editors: Francisco J. Cazorla

Issue

DARTS, Volume 7, Issue 2

Special Issue of the 35th European Conference on Object-Oriented Programming (ECOOP 2021)

Editors: William G. J. Halfond and Quentin Stiévenart

Document
DOI: 10.4230/LITES.9.1.1
Equivalence between the Urgency Based Shaper and Asynchronous Traffic Shaping in Time Sensitive Networking

Authors: Marc Boyer

Published in: LITES, Volume 9, Issue 1 (2024). Leibniz Transactions on Embedded Systems, Volume 9, Issue 1

Abstract
The Asynchronous Traffic Shaping (ATS) has been designed by the Time Sensitive Networking (TSN) group as a reshaping mechanism for real-time data flows, based on the initial proposition of the Urgency Based Shaper (UBS). Several studies have exhibited properties and limitations of this solution, but most of them are based on the model presented in the UBS definition [Specht and Samii, 2016], whereas the implementation described in the standard uses a different architecture and algorithm. This paper presents an equivalence proof between the model and the standard specification.
Cite as

Marc Boyer. Equivalence between the Urgency Based Shaper and Asynchronous Traffic Shaping in Time Sensitive Networking. In LITES, Volume 9, Issue 1 (2024). Leibniz Transactions on Embedded Systems, Volume 9, Issue 1, pp. 1:1-1:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{boyer:LITES.9.1.1,
  author =	{Boyer, Marc},
  title =	{{Equivalence between the Urgency Based Shaper and Asynchronous Traffic Shaping in Time Sensitive Networking}},
  journal =	{Leibniz Transactions on Embedded Systems},
  pages =	{1:1--1:27},
  ISSN =	{2199-2002},
  year =	{2024},
  volume =	{9},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LITES.9.1.1},
  URN =		{urn:nbn:de:0030-drops-198271},
  doi =		{10.4230/LITES.9.1.1},
  annote =	{Keywords: TSN, Time Sensitive Networking, ATS, Asynchronous Traffic Shaping, 802.1Qcr}
}
Document
DOI: 10.4230/DagRep.13.10.1
Automated mathematics: integrating proofs, algorithms and data (Dagstuhl Seminar 23401)

Authors: Andrej Bauer, Katja Berčič, Florian Rabe, Nicolas Thiéry, and Jure Taslak

Published in: Dagstuhl Reports, Volume 13, Issue 10 (2024)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23401 "Automated mathematics: integrating proofs, algorithms and data". The seminar brought together system developers, library authors, and users from key branches of computer-supported mathematics: formalized mathematics, symbolic computation, and mathematical databases. We addressed issues that were common to all areas of computer-supported mathematics: library management, dependencies and interoperability between software components, quality and correctness assurances, searching for information, and usability by end users. Early on in the week, we formed working groups that worked on specific tasks, as described in this report. Each day was divided into a morning talk session and an afternoon period devoted to working in groups. To keep everyone well-informed, we gathered each day before dinner for an informal "show & tell" session.
Cite as

Andrej Bauer, Katja Berčič, Florian Rabe, Nicolas Thiéry, and Jure Taslak. Automated mathematics: integrating proofs, algorithms and data (Dagstuhl Seminar 23401). In Dagstuhl Reports, Volume 13, Issue 10, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{bauer_et_al:DagRep.13.10.1,
  author =	{Bauer, Andrej and Ber\v{c}i\v{c}, Katja and Rabe, Florian and Thi\'{e}ry, Nicolas and Taslak, Jure},
  title =	{{Automated mathematics: integrating proofs, algorithms and data (Dagstuhl Seminar 23401)}},
  pages =	{1--23},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{13},
  number =	{10},
  editor =	{Bauer, Andrej and Ber\v{c}i\v{c}, Katja and Rabe, Florian and Thi\'{e}ry, Nicolas and Taslak, Jure},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.10.1},
  URN =		{urn:nbn:de:0030-drops-198319},
  doi =		{10.4230/DagRep.13.10.1},
  annote =	{Keywords: mathematical knowledge management, mathematical software, formalized mathematics, computer algebra, databases of mathematical structures}
}
Document
DOI: 10.4230/DagRep.13.10.24
Accountable Software Systems (Dagstuhl Seminar 23411)

Authors: Bettina Könighofer, Joshua A. Kroll, Ruzica Piskac, Michael Veale, and Filip Cano Córdoba

Published in: Dagstuhl Reports, Volume 13, Issue 10 (2024)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23411 "Accountable Software Systems". The seminar brought together an interdisciplinary group of researchers from the fields of formal methods, machine learning, philosophy, political science, law, and policy studies to address the critical issue of accountability in the development and deployment of software systems. As these systems increasingly assume roles within safety-critical domains of society, including transportation, healthcare, recruitment, and the judiciary, the seminar aimed to explore the multifaceted concept of accountability, its significance, and its implementation challenges in this context. During the seminar, experts engaged deeply in discussions, presentations, and collaborative sessions, focusing on key themes such as the application of formal tools in socio-technical accountability, the impact of computing infrastructures on software accountability, and the innovation of formal languages and models to improve accountability measures. This interdisciplinary dialogue underscored the complexities involved in defining and operationalizing accountability, especially in light of technological advancements and their societal implications. The participants of the seminar reached a consensus on the pressing need for ongoing research and cross-disciplinary efforts to develop effective accountability mechanisms, highlighting the critical role of integrating socio-technical approaches and formal methodologies to enhance the accountability of autonomous systems and their contributions to society.
Cite as

Bettina Könighofer, Joshua A. Kroll, Ruzica Piskac, Michael Veale, and Filip Cano Córdoba. Accountable Software Systems (Dagstuhl Seminar 23411). In Dagstuhl Reports, Volume 13, Issue 10, pp. 24-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{konighofer_et_al:DagRep.13.10.24,
  author =	{K\"{o}nighofer, Bettina and Kroll, Joshua A. and Piskac, Ruzica and Veale, Michael and C\'{o}rdoba, Filip Cano},
  title =	{{Accountable Software Systems (Dagstuhl Seminar 23411)}},
  pages =	{24--49},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{13},
  number =	{10},
  editor =	{K\"{o}nighofer, Bettina and Kroll, Joshua A. and Piskac, Ruzica and Veale, Michael and C\'{o}rdoba, Filip Cano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.10.24},
  URN =		{urn:nbn:de:0030-drops-198328},
  doi =		{10.4230/DagRep.13.10.24},
  annote =	{Keywords: accountability, Responsible Decision Making, Societal Impact of AI}
}
  • Refine by Author
  • 116 Saurabh, Saket
  • 72 Lokshtanov, Daniel
  • 71 Fomin, Fedor V.
  • 56 Zehavi, Meirav
  • 48 Golovach, Petr A.
  • Show More...

  • Refine by Classification
  • 610 Theory of computation → Design and analysis of algorithms
  • 544 Theory of computation → Computational geometry
  • 425 Mathematics of computing → Graph algorithms
  • 398 Theory of computation → Graph algorithms analysis
  • 366 Theory of computation → Distributed algorithms
  • Show More...

  • Refine by Keyword
  • 358 Table of Contents
  • 350 Preface
  • 304 Front Matter
  • 280 Conference Organization
  • 198 approximation algorithms
  • Show More...

  • Refine by Type
  • 16073 document
  • 11 volume
  • 1 issue

  • Refine by Publication Year
  • 1755 2023
  • 1668 2022
  • 1598 2018
  • 1580 2021
  • 1570 2020
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact