( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem.

, и . J. Netw. Syst. Manag., 31 (1): 24 (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sayuri Hara

Takeshi Hara

Fumio Hara

Saku Hara

Yoshio Hara

 

Другие публикации лиц с тем же именем

Base Station-Driven PAPR Reduction Method Utilizing Null Space for MIMO-OFDM Systems With Amplify-and-Forward Relaying., , и . IEEE Access, (2024)Massively Concurrent Non-Orthogonal Multiple Access for 5G Networks and Beyond., , , и . IEEE Access, (2019)Energy-Efficient Frequency Block-Dependent Base Station Sleep Control Based on a Decentralized Probabilistic Approach., , , , и . VTC Fall, стр. 1-5. IEEE, (2023)Autonomous Decentralized User Association Method to Maximize Integrated System Throughput for Multi-service Coexistence., , , и . VTC Fall, стр. 1-5. IEEE, (2022)HARQ Using Hierarchical Tree-Structured Random Access Identifiers with Random Retransmission Time Back-Off in NOMA-Based Random Access., , , и . VTC Fall, стр. 1-6. IEEE, (2022)Lagrangian Heuristics for Capacitated Shortest Path Tour Problem Based Online Service Chaining., и . NOMS, стр. 1-9. IEEE, (2022)Capacitated Refuge Assignment for Speedy and Reliable Evacuation., , , и . ISPRS Int. J. Geo Inf., 9 (7): 442 (2020)Resource-Efficient and Availability-Aware Service Chaining and VNF Placement with VNF Diversity and Redundancy., , , и . IEICE Trans. Commun., 107 (1): 105-116 (января 2024)Stochastic Learning Robust Beamforming for Millimeter-Wave Systems With Path Blockage., , , , , и . IEEE Wirel. Commun. Lett., 9 (9): 1557-1561 (2020)Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem., и . J. Netw. Syst. Manag., 31 (1): 24 (2023)