Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Niek Bouman"'
Autor:
Bas Van Stein, Elena Raponi, Zahra Sadeghi, Niek Bouman, Roeland C. H. J. Van Ham, Thomas Back
Publikováno v:
IEEE Access, Vol 10, Pp 103364-103381 (2022)
Explainable Artificial Intelligence (XAI) is an increasingly important field of research required to bring AI to the next level in real-world applications. Global sensitivity analysis (GSA) methods play an important role in XAI, as they can provide a
Externí odkaz:
https://doaj.org/article/912602b853f048eea9e8c199e54528ad
Publikováno v:
Queueing Systems: Theory and Applications, 77(1), 33-74. Springer
We consider a broad class of queueing models with random state-dependent vacation periods, which arise in the analysis of queue-based back-off algorithms in wireless random-access networks. In contrast to conventional models, the vacation periods may
Publikováno v:
Queueing Systems: Theory and Applications, 77(2), 211-242. Springer
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the optimal thr
Publikováno v:
Queueing Systems: Theory and Applications, 77(2), 243-273. Springer
SIGMETRICS
ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013), 141-152
STARTPAGE=141;ENDPAGE=152;TITLE=ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013)
SIGMETRICS
ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013), 141-152
STARTPAGE=141;ENDPAGE=152;TITLE=ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013)
Recent advances have resulted in queue-based algorithms for medium access control which operate in a distributed fashion, and yet achieve the optimal throughput performance of centralized scheduling algorithms. However, fundamental performance bounds
Publikováno v:
SIAM Journal on Discrete Mathematics, 27(3), 1295-1312. Society for Industrial and Applied Mathematics (SIAM)
We explore the minimum energy configurations of repelling particles distributed over $n$ possible locations forming a toric grid. We conjecture that the most energy-efficient way to distribute $n/2$ particles over this space is to place them in a che
Publikováno v:
IFIP PERFORMANCE 2011 (29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation, Amsterdam, The Netherlands, October 18-20, 2011. Proceedings), 32-34
STARTPAGE=32;ENDPAGE=34;TITLE=IFIP PERFORMANCE 2011 (29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation, Amsterdam, The Netherlands, October 18-20, 2011. Proceedings)
STARTPAGE=32;ENDPAGE=34;TITLE=IFIP PERFORMANCE 2011 (29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation, Amsterdam, The Netherlands, October 18-20, 2011. Proceedings)
Backlog-based CSMA strategies provide a popular mechanism for distributed medium access control in wireless networks. When suitably designed, such strategies offer the striking capability to match the optimal throughput performance of centralized sch
Publikováno v:
ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013), 117-128
STARTPAGE=117;ENDPAGE=128;TITLE=ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013)
SIGMETRICS
STARTPAGE=117;ENDPAGE=128;TITLE=ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'13, Pittsburgh PA, USA, June 17-21, 2013)
SIGMETRICS
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed backlog-based random-access schemes provide the striking capability to match the optimal t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d82359a9db508727593adbbec4b904c8
https://research.tue.nl/nl/publications/a96e494b-34d7-40c3-bf3e-b604b7d92468
https://research.tue.nl/nl/publications/a96e494b-34d7-40c3-bf3e-b604b7d92468
Publikováno v:
49th Allerton Conference on Communication, Control and Computing (Monticello IL, USA, September 28-30, 2011), 384-391
STARTPAGE=384;ENDPAGE=391;TITLE=49th Allerton Conference on Communication, Control and Computing (Monticello IL, USA, September 28-30, 2011)
Allerton
STARTPAGE=384;ENDPAGE=391;TITLE=49th Allerton Conference on Communication, Control and Computing (Monticello IL, USA, September 28-30, 2011)
Allerton
We explore the achievable delay performance in wireless CSMA networks. While relatively simple and inherently distributed in nature, suitably designed backlog-based CSMA schemes provide the striking capability to match the optimal throughput performa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e00342e7523c326aadd6107d58e2149f
https://research.tue.nl/nl/publications/c498df73-f02c-4e94-9f48-b4d9c49acf8b
https://research.tue.nl/nl/publications/c498df73-f02c-4e94-9f48-b4d9c49acf8b