Networks, Communication, and Computing Vol. 2
| dc.contributor.editor | Farago, Andras | |
| dc.date.accessioned | 2022-01-11T13:36:18Z | |
| dc.date.available | 2022-01-11T13:36:18Z | |
| dc.date.issued | 2021 | |
| dc.identifier | ONIX_20220111_9783036512341_322 | |
| dc.identifier.uri | https://directory.doabooks.org/handle/20.500.12854/76587 | |
| dc.description.abstract | Networks, communications, and computing have become ubiquitous and inseparable parts of everyday life. This book is based on a Special Issue of the Algorithms journal, and it is devoted to the exploration of the many-faceted relationship of networks, communications, and computing. The included papers explore the current state-of-the-art research in these areas, with a particular interest in the interactions among the fields. | |
| dc.language | English | |
| dc.subject.classification | thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries | en_US |
| dc.subject.other | communication traffic prediction | |
| dc.subject.other | intelligent traffic management | |
| dc.subject.other | deformable convolution | |
| dc.subject.other | attention mechanism | |
| dc.subject.other | the next generation of telecommunication (5G) | |
| dc.subject.other | deep learning | |
| dc.subject.other | reinforcement learning | |
| dc.subject.other | systematic review | |
| dc.subject.other | cellular networks | |
| dc.subject.other | underwater wireless sensor networks | |
| dc.subject.other | ant colony optimization algorithms | |
| dc.subject.other | clustering routing algorithms | |
| dc.subject.other | energy efficiency | |
| dc.subject.other | network lifetime | |
| dc.subject.other | unmanned aerial vehicles | |
| dc.subject.other | UAV placement | |
| dc.subject.other | metaheuristics | |
| dc.subject.other | routing | |
| dc.subject.other | NP-complete | |
| dc.subject.other | NP-hard | |
| dc.subject.other | approximation | |
| dc.subject.other | polynomial time algorithm | |
| dc.subject.other | disjoint connecting paths | |
| dc.subject.other | unsplittable flow | |
| dc.subject.other | network design | |
| dc.title | Networks, Communication, and Computing Vol. 2 | |
| dc.type | book | |
| oapen.identifier.doi | 10.3390/books978-3-0365-1235-8 | |
| oapen.relation.isPublishedBy | 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 | |
| oapen.relation.isbn | 9783036512341 | |
| oapen.relation.isbn | 9783036512358 | |
| oapen.pages | 108 | |
| oapen.place.publication | Basel, Switzerland |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||

