default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavide Zorzenon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Davide Zorzenon
, Jan Komenda, Jörg Raisch:
Switched max-plus linear-dual inequalities: cycle time analysis and applications. Discret. Event Dyn. Syst. 34(1): 199-250 (2024)- 2022
- [j4]Davide Zorzenon, Jan Komenda, Jörg Raisch:
Periodic Trajectories in P-Time Event Graphs and the Non-Positive Circuit Weight Problem. IEEE Control. Syst. Lett. 6: 686-691 (2022) - [j3]Davide Zorzenon, Jan Komenda, Jörg Raisch:
The non-positive circuit weight problem in parametric graphs: A solution based on dioid theory. Discret. Appl. Math. 315: 56-70 (2022) - 2021
- [j2]Vittorio Casagrande, Gianfranco Fenu, Felice Andrea Pellegrino, Gilberto Pin, Erica Salvato, Davide Zorzenon:
Machine learning for computationally efficient electrical loads estimation in consumer washing machines. Neural Comput. Appl. 33(22): 15159-15170 (2021) - [j1]Gilberto Pin, Gianfranco Fenu, Vittorio Casagrande, Davide Zorzenon, Thomas Parisini:
Robust Stabilization of a Class of Nonlinear Systems Controlled Over Communication Networks. IEEE Trans. Autom. Control. 66(7): 3036-3051 (2021)
Conference and Workshop Papers
- 2022
- [c4]Angelos Koumpis, Davide Zorzenon, Fabio Molinari:
Automation Of Roundabouts Via Consensus-based Distributed Auctions and Stochastic Model Predictive Control. ECC 2022: 14-20 - 2021
- [c3]Davide Zorzenon, Fabio Molinari, Jörg Raisch:
Low Complexity Method for Simulation of Epidemics Based on Dijkstra's Algorithm. ACC 2021: 3018-3025 - 2020
- [c2]Davide Zorzenon, Jan Komenda, Jörg Raisch:
Bounded Consistency of P-Time Event Graphs. CDC 2020: 79-85 - [c1]Alexander Babichev, Vittorio Casagrande, Luca Della Schiava, Gianfranco Fenu, Imola Fodor, Enrico Marson, Felice Andrea Pellegrino, Gilberto Pin, Erica Salvato, Michele Toppano, Davide Zorzenon:
Loads Estimation using Deep Learning Techniques in Consumer Washing Machines. ICPRAM 2020: 425-432
Informal and Other Publications
- 2023
- [i8]Davide Zorzenon, Jan Komenda, Jörg Raisch:
Switched max-plus linear-dual inequalities: cycle time analysis and applications. CoRR abs/2305.02934 (2023) - [i7]Davide Zorzenon, Jörg Raisch:
Consistency of P-time event graphs is decidable in polynomial time (extended version). CoRR abs/2312.10764 (2023) - 2022
- [i6]Davide Zorzenon, Jan Komenda, Jörg Raisch:
Switched Max-Plus Linear-Dual Inequalities: Application in Scheduling of Multi-Product Processing Networks. CoRR abs/2204.01156 (2022) - [i5]Davide Zorzenon, Jirí Balun, Jörg Raisch:
Weak consistency of P-time event graphs. CoRR abs/2206.00478 (2022) - [i4]Davide Zorzenon, Nataliia Zaiets, Jörg Raisch:
Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop. CoRR abs/2211.07601 (2022) - 2021
- [i3]Davide Zorzenon, Jan Komenda, Jörg Raisch:
The non-positive circuit weight problem in parametric graphs: a fast solution based on dioid theory. CoRR abs/2102.12264 (2021) - [i2]Davide Zorzenon, Jan Komenda, Jörg Raisch:
Periodic trajectories in P-time event graphs and the non-positive circuit weight problem. CoRR abs/2103.01024 (2021) - 2020
- [i1]Davide Zorzenon, Fabio Molinari, Jörg Raisch:
Low Complexity Method for Simulation of Epidemics Based on Dijkstra's Algorithm. CoRR abs/2010.02540 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
