default search action
Marco Belleschi
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j5]Gábor Fodor, Hieu Do, Shehzad Ali Ashraf, Ricardo Blasco, Wanlu Sun, Marco Belleschi, Liang Hu:
Supporting Enhanced Vehicle-to-Everything Services by LTE Release 15 Systems. IEEE Commun. Stand. Mag. 3(1): 26-33 (2019) - 2017
- [c10]Min Wang, Martin Winbjork, Zhang Zhang, Ricardo Blasco, Hieu Do, Stefano Sorrentino, Marco Belleschi, Yunpeng Zang:
Comparison of LTE and DSRC-Based Connectivity for Intelligent Transportation Systems. VTC Spring 2017: 1-5 - 2015
- [j4]Marco Belleschi, Gábor Fodor, Demia Della Penda, Aidilla Pradini, Mikael Johansson, Andrea Abrardo:
Benchmarking Practical RRM Algorithms for D2D Communications in LTE Advanced. Wirel. Pers. Commun. 82(2): 883-910 (2015) - 2014
- [j3]Marco Moretti, Andrea Abrardo, Marco Belleschi:
On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems. IEEE Signal Process. Lett. 21(11): 1428-1432 (2014) - [c9]Aidilla Pradini, Gábor Fodor, Guowang Miao, Marco Belleschi:
Near-optimal practical power control schemes for D2D communications in cellular networks. EuCNC 2014: 1-5 - 2013
- [j2]Andrea Abrardo, Marco Belleschi, Paolo Detti:
Optimal radio resources and transmission formats assignment in OFDMA systems. Comput. Oper. Res. 40(10): 2284-2300 (2013) - [c8]Gábor Fodor, Demia Della Penda, Marco Belleschi, Mikael Johansson, Andrea Abrardo:
A comparative study of power control approaches for device-to-device communications. ICC 2013: 6008-6013 - [i1]Gábor Fodor, Marco Belleschi, Demia Della Penda, Aidilla Pradini, Mikael Johansson, Andrea Abrardo:
Benchmarking Practical RRM Algorithms for D2D Communications in LTE Advanced. CoRR abs/1306.5305 (2013) - 2012
- [j1]Andrea Abrardo, Marco Belleschi, Paolo Detti, Marco Moretti:
Message Passing Resource Allocation for the Uplink of Multi-Carrier Multi-Format Systems. IEEE Trans. Wirel. Commun. 11(1): 130-141 (2012) - [c7]Andrea Abrardo, Marco Belleschi, Gábor Fodor, Marco Moretti:
A message passing approach for resource allocation in cellular OFDMA communications. GLOBECOM 2012: 4583-4588 - 2011
- [c6]Andrea Abrardo, Marco Belleschi, Paolo Detti:
Resources and transmission formats allocation in OFDMA networks. CTW 2011: 19-22 - [c5]Marco Belleschi, Gábor Fodor, Andrea Abrardo:
Performance analysis of a distributed resource allocation scheme for D2D communications. GLOBECOM Workshops 2011: 358-362 - [c4]Andrea Abrardo, Marco Belleschi, Paolo Detti, Marco Moretti:
A Min-Sum Approach for Resource Allocation in Communication Systems. ICC 2011: 1-6 - [c3]Marco Belleschi, Paolo Detti, Andrea Abrardo:
Complexity analysis and heuristic algorithms for radio resource allocation in OFDMA networks. ICT 2011: 101-106 - 2010
- [c2]Andrea Abrardo, Marco Belleschi, Paolo Detti, Marco Moretti:
A message passing approach for multi-cellular OFDMA systems. ISWCS 2010: 651-655
2000 – 2009
- 2009
- [c1]Marco Belleschi, Lapo Balucanti, Pablo Soldati, Mikael Johansson, Andrea Abrardo:
Fast Power Control for Cross-Layer Optimal Resource Allocation in DS-CDMA Wireless Networks. ICC 2009: 1-6
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-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint