default search action
Milutin Radonjic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Suada Hadzovic, Sasa Mrdovic, Milutin Radonjic:
A Path Towards an Internet of Things and Artificial Intelligence Regulatory Framework. IEEE Commun. Mag. 61(7): 90-96 (2023) - 2021
- [j8]Suada Hadzovic, Sasa Mrdovic, Milutin Radonjic:
Identification of IoT Actors. Sensors 21(6): 2093 (2021) - [j7]Nikola Zaric, Milutin Radonjic, Nikola Pavlicevic, Sanja Paunovic Zaric:
Design of a Kitchen-Monitoring and Decision-Making System to Support AAL Applications. Sensors 21(13): 4449 (2021)
2010 – 2019
- 2017
- [j6]Milutin Radonjic, Nikola Ljumovic, Danilo Misovic, Ivo Maljevic, Kenji Yoshigoe, Igor Radusinovic:
CQ Ethernet Switch Implementation on the NetFPGA Platform. Wirel. Pers. Commun. 92(1): 5-19 (2017) - [j5]Gordana Gardasevic, Mladen Veletic, Nebojsa Maletic, Dragan Vasiljevic, Igor Radusinovic, Slavica Tomovic, Milutin Radonjic:
The IoT Architectural Framework, Design Issues and Application Domains. Wirel. Pers. Commun. 92(1): 127-148 (2017) - 2015
- [j4]Gordana Gardasevic, Soko Divanovic, Milutin Radonjic, Igor Radusinovic:
A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm. IEICE Trans. Commun. 98-B(1): 201-208 (2015) - [c6]Nikola Zaric, Milutin Radonjic, Milica Pejanovic-Djurisic, Igor Radusinovic:
An example of monitoring system with reasoning module for ambient assisted living applications. EUROCON 2015: 1-6 - 2013
- [c5]Igor Radusinovic, Milutin Radonjic, Milica Pejanovic-Djurisic:
Analysis of WRR scheduling algorithm frame size impact on CQ switch performance. AFRICON 2013: 1-5 - [c4]Milutin Radonjic, Ivo Maljevic, Nedjeljko Lekic, Igor Radusinovic:
Performance analysis of variable packet size crosspoint-queued switch. EUROCON 2013: 673-678 - [c3]Soko Divanovic, Milutin Radonjic, Igor Radusinovic, Gordana Gardasevic:
Performance analysis of crosspoint queued crossbar switch with weighted round robin scheduling algorithm under unbalanced bursty traffic. ISCC 2013: 120-124 - 2012
- [j3]Milutin Radonjic, Igor Radusinovic, Anita Simurina, Dusan Banovic:
A New Analytical Model for the CQ Switch Performance Analysis under the Bursty Traffic. IEICE Trans. Commun. 95-B(2): 595-598 (2012) - 2011
- [j2]Milutin Radonjic, Igor Radusinovic:
Impact of scheduling algorithms on performance of crosspoint-queued switch. Ann. des Télécommunications 66(5-6): 363-376 (2011) - [c2]Milutin Radonjic, Igor Radusinovic, Zoran Veljovic, Ivo Maljevic:
Performance evaluation of crosspoint queued switch under the heavy traffic. ISCC 2011: 943-949 - 2010
- [j1]Milutin Radonjic, Igor Radusinovic, Jelena Cvorovic, Kenji Yoshigoe:
Iterative Throughput Calculation for Crosspoint Queued Switch. IEICE Trans. Commun. 93-B(12): 3635-3638 (2010) - [c1]Milutin Radonjic, Igor Radusinovic:
Buffer length impact to 32x32 crosspoint queued crossbar switch performance. ISCC 2010: 954-959
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-08-05 21: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