Bandwidth and Power Allocation for Task-Oriented SemanticCommunication Article Swipe
Chuanhong Liu
,
Caili Guo
,
Yang Yang
,
Jiujiu Chen
·
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2201.10795
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2201.10795
Deep learning enabled semantic communication has been studied to improve communication efficiency while guaranteeing intelligent task performance. Different from conventional communications systems, the resource allocation in semantic communications no longer just pursues the bit transmission rate, but focuses on how to better compress and transmit semantic to complete subsequent intelligent tasks. This paper aims to appropriately allocate the bandwidth and power for artificial intelligence (AI) task-oriented semantic communication and proposes a joint compressiom ratio and resource allocation (CRRA) algorithm. We first analyze the relationship between the AI task's performance and the semantic information. Then, to optimize the AI task's perfomance under resource constraints, a bandwidth and power allocation problem is formulated. The problem is first separated into two subproblems due to the non-convexity. The first subproblem is a compression ratio optimization problem with a given resource allocation scheme, which is solved by a enumeration algorithm. The second subproblem is to find the optimal resource allocation scheme, which is transformed into a convex problem by successive convex approximation method, and solved by a convex optimization method. The optimal semantic compression ratio and resource allocation scheme are obtained by iteratively solving these two subproblems. Simulation results show that the proposed algorithm can efficiently improve the AI task's performance by up to 30\% comprared with baselines.
Related Topics
Concepts
Computer science
Resource allocation
Bandwidth (computing)
Mathematical optimization
Bandwidth allocation
Task (project management)
Optimization problem
Convex optimization
Convexity
Artificial intelligence
Algorithm
Regular polygon
Computer network
Mathematics
Engineering
Economics
Geometry
Financial economics
Systems engineering
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2201.10795
- https://arxiv.org/pdf/2201.10795
- OA Status
- green
- Cited By
- 7
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4226162028
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4226162028Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2201.10795Digital Object Identifier
- Title
-
Bandwidth and Power Allocation for Task-Oriented SemanticCommunicationWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-01-26Full publication date if available
- Authors
-
Chuanhong Liu, Caili Guo, Yang Yang, Jiujiu ChenList of authors in order
- Landing page
-
https://arxiv.org/abs/2201.10795Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2201.10795Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2201.10795Direct OA link when available
- Concepts
-
Computer science, Resource allocation, Bandwidth (computing), Mathematical optimization, Bandwidth allocation, Task (project management), Optimization problem, Convex optimization, Convexity, Artificial intelligence, Algorithm, Regular polygon, Computer network, Mathematics, Engineering, Economics, Geometry, Financial economics, Systems engineeringTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
7Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 2, 2023: 5Per-year citation counts (last 5 years)
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4226162028 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2201.10795 |
| ids.doi | https://doi.org/10.48550/arxiv.2201.10795 |
| ids.openalex | https://openalex.org/W4226162028 |
| fwci | |
| type | preprint |
| title | Bandwidth and Power Allocation for Task-Oriented SemanticCommunication |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12131 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.8924999833106995 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Wireless Signal Modulation Classification |
| topics[1].id | https://openalex.org/T10627 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.8417999744415283 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Advanced Image and Video Retrieval Techniques |
| topics[2].id | https://openalex.org/T12702 |
| topics[2].field.id | https://openalex.org/fields/28 |
| topics[2].field.display_name | Neuroscience |
| topics[2].score | 0.8389999866485596 |
| topics[2].domain.id | https://openalex.org/domains/1 |
| topics[2].domain.display_name | Life Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2808 |
| topics[2].subfield.display_name | Neurology |
| topics[2].display_name | Brain Tumor Detection and Classification |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7981271743774414 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C29202148 |
| concepts[1].level | 2 |
| concepts[1].score | 0.68552565574646 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q287260 |
| concepts[1].display_name | Resource allocation |
| concepts[2].id | https://openalex.org/C2776257435 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5681546926498413 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1576430 |
| concepts[2].display_name | Bandwidth (computing) |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.5470364093780518 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C200157131 |
| concepts[4].level | 3 |
| concepts[4].score | 0.5235414505004883 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q4854763 |
| concepts[4].display_name | Bandwidth allocation |
| concepts[5].id | https://openalex.org/C2780451532 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5015294551849365 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q759676 |
| concepts[5].display_name | Task (project management) |
| concepts[6].id | https://openalex.org/C137836250 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4857654869556427 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[6].display_name | Optimization problem |
| concepts[7].id | https://openalex.org/C157972887 |
| concepts[7].level | 3 |
| concepts[7].score | 0.48404616117477417 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q463359 |
| concepts[7].display_name | Convex optimization |
| concepts[8].id | https://openalex.org/C72134830 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4654342234134674 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q5166524 |
| concepts[8].display_name | Convexity |
| concepts[9].id | https://openalex.org/C154945302 |
| concepts[9].level | 1 |
| concepts[9].score | 0.3223278522491455 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[9].display_name | Artificial intelligence |
| concepts[10].id | https://openalex.org/C11413529 |
| concepts[10].level | 1 |
| concepts[10].score | 0.31364044547080994 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[10].display_name | Algorithm |
| concepts[11].id | https://openalex.org/C112680207 |
| concepts[11].level | 2 |
| concepts[11].score | 0.3072224259376526 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q714886 |
| concepts[11].display_name | Regular polygon |
| concepts[12].id | https://openalex.org/C31258907 |
| concepts[12].level | 1 |
| concepts[12].score | 0.10695973038673401 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[12].display_name | Computer network |
| concepts[13].id | https://openalex.org/C33923547 |
| concepts[13].level | 0 |
| concepts[13].score | 0.09655508399009705 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[13].display_name | Mathematics |
| concepts[14].id | https://openalex.org/C127413603 |
| concepts[14].level | 0 |
| concepts[14].score | 0.06731685996055603 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[14].display_name | Engineering |
| concepts[15].id | https://openalex.org/C162324750 |
| concepts[15].level | 0 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[15].display_name | Economics |
| concepts[16].id | https://openalex.org/C2524010 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[16].display_name | Geometry |
| concepts[17].id | https://openalex.org/C106159729 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q2294553 |
| concepts[17].display_name | Financial economics |
| concepts[18].id | https://openalex.org/C201995342 |
| concepts[18].level | 1 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q682496 |
| concepts[18].display_name | Systems engineering |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7981271743774414 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/resource-allocation |
| keywords[1].score | 0.68552565574646 |
| keywords[1].display_name | Resource allocation |
| keywords[2].id | https://openalex.org/keywords/bandwidth |
| keywords[2].score | 0.5681546926498413 |
| keywords[2].display_name | Bandwidth (computing) |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.5470364093780518 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/bandwidth-allocation |
| keywords[4].score | 0.5235414505004883 |
| keywords[4].display_name | Bandwidth allocation |
| keywords[5].id | https://openalex.org/keywords/task |
| keywords[5].score | 0.5015294551849365 |
| keywords[5].display_name | Task (project management) |
| keywords[6].id | https://openalex.org/keywords/optimization-problem |
| keywords[6].score | 0.4857654869556427 |
| keywords[6].display_name | Optimization problem |
| keywords[7].id | https://openalex.org/keywords/convex-optimization |
| keywords[7].score | 0.48404616117477417 |
| keywords[7].display_name | Convex optimization |
| keywords[8].id | https://openalex.org/keywords/convexity |
| keywords[8].score | 0.4654342234134674 |
| keywords[8].display_name | Convexity |
| keywords[9].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[9].score | 0.3223278522491455 |
| keywords[9].display_name | Artificial intelligence |
| keywords[10].id | https://openalex.org/keywords/algorithm |
| keywords[10].score | 0.31364044547080994 |
| keywords[10].display_name | Algorithm |
| keywords[11].id | https://openalex.org/keywords/regular-polygon |
| keywords[11].score | 0.3072224259376526 |
| keywords[11].display_name | Regular polygon |
| keywords[12].id | https://openalex.org/keywords/computer-network |
| keywords[12].score | 0.10695973038673401 |
| keywords[12].display_name | Computer network |
| keywords[13].id | https://openalex.org/keywords/mathematics |
| keywords[13].score | 0.09655508399009705 |
| keywords[13].display_name | Mathematics |
| keywords[14].id | https://openalex.org/keywords/engineering |
| keywords[14].score | 0.06731685996055603 |
| keywords[14].display_name | Engineering |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2201.10795 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2201.10795 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2201.10795 |
| locations[1].id | doi:10.48550/arxiv.2201.10795 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2201.10795 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5075387306 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9620-1816 |
| authorships[0].author.display_name | Chuanhong Liu |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Liu, Chuanhong |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5058648594 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-8892-4520 |
| authorships[1].author.display_name | Caili Guo |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Guo, Caili |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5100397725 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-0608-9408 |
| authorships[2].author.display_name | Yang Yang |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Yang, Yang |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5077440475 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-1731-9435 |
| authorships[3].author.display_name | Jiujiu Chen |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Chen, Jiujiu |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2201.10795 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Bandwidth and Power Allocation for Task-Oriented SemanticCommunication |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T12131 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.8924999833106995 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Wireless Signal Modulation Classification |
| related_works | https://openalex.org/W2027592263, https://openalex.org/W2037283301, https://openalex.org/W2756132392, https://openalex.org/W3035814349, https://openalex.org/W4285101096, https://openalex.org/W2518949622, https://openalex.org/W4382725876, https://openalex.org/W2084892497, https://openalex.org/W2115614142, https://openalex.org/W4320477335 |
| cited_by_count | 7 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 2 |
| counts_by_year[1].year | 2023 |
| counts_by_year[1].cited_by_count | 5 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2201.10795 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2201.10795 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2201.10795 |
| primary_location.id | pmh:oai:arXiv.org:2201.10795 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2201.10795 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2201.10795 |
| publication_date | 2022-01-26 |
| publication_year | 2022 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 70, 103, 127, 133, 142, 160, 171 |
| abstract_inverted_index.AI | 86, 97, 203 |
| abstract_inverted_index.We | 79 |
| abstract_inverted_index.by | 141, 163, 170, 186, 206 |
| abstract_inverted_index.in | 25 |
| abstract_inverted_index.is | 109, 113, 126, 139, 148, 157 |
| abstract_inverted_index.no | 28 |
| abstract_inverted_index.on | 38 |
| abstract_inverted_index.to | 8, 40, 46, 54, 94, 120, 149, 208 |
| abstract_inverted_index.up | 207 |
| abstract_inverted_index.The | 111, 123, 145, 175 |
| abstract_inverted_index.and | 43, 59, 68, 74, 89, 105, 168, 180 |
| abstract_inverted_index.are | 184 |
| abstract_inverted_index.bit | 33 |
| abstract_inverted_index.but | 36 |
| abstract_inverted_index.can | 199 |
| abstract_inverted_index.due | 119 |
| abstract_inverted_index.for | 61 |
| abstract_inverted_index.has | 5 |
| abstract_inverted_index.how | 39 |
| abstract_inverted_index.the | 22, 32, 57, 82, 85, 90, 96, 121, 151, 196, 202 |
| abstract_inverted_index.two | 117, 190 |
| abstract_inverted_index.(AI) | 64 |
| abstract_inverted_index.30\% | 209 |
| abstract_inverted_index.Deep | 0 |
| abstract_inverted_index.This | 51 |
| abstract_inverted_index.aims | 53 |
| abstract_inverted_index.been | 6 |
| abstract_inverted_index.find | 150 |
| abstract_inverted_index.from | 18 |
| abstract_inverted_index.into | 116, 159 |
| abstract_inverted_index.just | 30 |
| abstract_inverted_index.show | 194 |
| abstract_inverted_index.task | 15 |
| abstract_inverted_index.that | 195 |
| abstract_inverted_index.with | 132, 211 |
| abstract_inverted_index.Then, | 93 |
| abstract_inverted_index.first | 80, 114, 124 |
| abstract_inverted_index.given | 134 |
| abstract_inverted_index.joint | 71 |
| abstract_inverted_index.paper | 52 |
| abstract_inverted_index.power | 60, 106 |
| abstract_inverted_index.rate, | 35 |
| abstract_inverted_index.ratio | 73, 129, 179 |
| abstract_inverted_index.these | 189 |
| abstract_inverted_index.under | 100 |
| abstract_inverted_index.which | 138, 156 |
| abstract_inverted_index.while | 12 |
| abstract_inverted_index.(CRRA) | 77 |
| abstract_inverted_index.better | 41 |
| abstract_inverted_index.convex | 161, 165, 172 |
| abstract_inverted_index.longer | 29 |
| abstract_inverted_index.scheme | 183 |
| abstract_inverted_index.second | 146 |
| abstract_inverted_index.solved | 140, 169 |
| abstract_inverted_index.task's | 87, 98, 204 |
| abstract_inverted_index.tasks. | 50 |
| abstract_inverted_index.analyze | 81 |
| abstract_inverted_index.between | 84 |
| abstract_inverted_index.enabled | 2 |
| abstract_inverted_index.focuses | 37 |
| abstract_inverted_index.improve | 9, 201 |
| abstract_inverted_index.method, | 167 |
| abstract_inverted_index.method. | 174 |
| abstract_inverted_index.optimal | 152, 176 |
| abstract_inverted_index.problem | 108, 112, 131, 162 |
| abstract_inverted_index.pursues | 31 |
| abstract_inverted_index.results | 193 |
| abstract_inverted_index.scheme, | 137, 155 |
| abstract_inverted_index.solving | 188 |
| abstract_inverted_index.studied | 7 |
| abstract_inverted_index.allocate | 56 |
| abstract_inverted_index.complete | 47 |
| abstract_inverted_index.compress | 42 |
| abstract_inverted_index.learning | 1 |
| abstract_inverted_index.obtained | 185 |
| abstract_inverted_index.optimize | 95 |
| abstract_inverted_index.proposed | 197 |
| abstract_inverted_index.proposes | 69 |
| abstract_inverted_index.resource | 23, 75, 101, 135, 153, 181 |
| abstract_inverted_index.semantic | 3, 26, 45, 66, 91, 177 |
| abstract_inverted_index.systems, | 21 |
| abstract_inverted_index.transmit | 44 |
| abstract_inverted_index.Different | 17 |
| abstract_inverted_index.algorithm | 198 |
| abstract_inverted_index.bandwidth | 58, 104 |
| abstract_inverted_index.comprared | 210 |
| abstract_inverted_index.separated | 115 |
| abstract_inverted_index.Simulation | 192 |
| abstract_inverted_index.algorithm. | 78, 144 |
| abstract_inverted_index.allocation | 24, 76, 107, 136, 154, 182 |
| abstract_inverted_index.artificial | 62 |
| abstract_inverted_index.baselines. | 212 |
| abstract_inverted_index.efficiency | 11 |
| abstract_inverted_index.perfomance | 99 |
| abstract_inverted_index.subproblem | 125, 147 |
| abstract_inverted_index.subsequent | 48 |
| abstract_inverted_index.successive | 164 |
| abstract_inverted_index.compressiom | 72 |
| abstract_inverted_index.compression | 128, 178 |
| abstract_inverted_index.efficiently | 200 |
| abstract_inverted_index.enumeration | 143 |
| abstract_inverted_index.formulated. | 110 |
| abstract_inverted_index.intelligent | 14, 49 |
| abstract_inverted_index.iteratively | 187 |
| abstract_inverted_index.performance | 88, 205 |
| abstract_inverted_index.subproblems | 118 |
| abstract_inverted_index.transformed | 158 |
| abstract_inverted_index.constraints, | 102 |
| abstract_inverted_index.conventional | 19 |
| abstract_inverted_index.guaranteeing | 13 |
| abstract_inverted_index.information. | 92 |
| abstract_inverted_index.intelligence | 63 |
| abstract_inverted_index.optimization | 130, 173 |
| abstract_inverted_index.performance. | 16 |
| abstract_inverted_index.relationship | 83 |
| abstract_inverted_index.subproblems. | 191 |
| abstract_inverted_index.transmission | 34 |
| abstract_inverted_index.appropriately | 55 |
| abstract_inverted_index.approximation | 166 |
| abstract_inverted_index.communication | 4, 10, 67 |
| abstract_inverted_index.task-oriented | 65 |
| abstract_inverted_index.communications | 20, 27 |
| abstract_inverted_index.non-convexity. | 122 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/8 |
| sustainable_development_goals[0].score | 0.46000000834465027 |
| sustainable_development_goals[0].display_name | Decent work and economic growth |
| citation_normalized_percentile |