Showing 921 - 940 results of 1,377 for search '((( resource OR resources) allocation algorithm ) OR ( (source OR sources) allocation algorithm ))', query time: 0.20s Refine Results
  1. 921

    User-centric energy efficiency fairness in backscatter-assisted wireless powered communication network by Yinghui YE, Liqin SHI, Guangyue LU

    Published 2020-07-01
    “…In order to address the unfair user-centric energy efficiency (EE) problem caused by channel difference in the backscatter-assisted wireless powered communication network,a resource allocation scheme was proposed.Firstly,a mixed integer nonconvex fractional programming problem was formulated to maximize the minimum user-centric EE,subject to the quality of service and energy-causality constraints.Based on the generalized fractional programming theory,the original problem was transformed into a mixed integer nonconvex subtraction problem.With the aid of the slack variable,the proof by contradiction,the auxiliary variable and the mixed integer nonconvex subtraction problem were further transformed into an equivalent convex problem.Finally,an iterative algorithm was proposed to obtain the optimal solutions.Computer simulations validated the quick convergence of the proposed iterative algorithm,and that the developed resource allocation scheme efficiently guarantees the fairness among users in terms of EE.…”
    Get full text
    Article
  2. 922

    Toward Efficient Hierarchical Federated Learning Design Over Multi-Hop Wireless Communications Networks by Tu Viet Nguyen, Nhan Duc Ho, Hieu Thien Hoang, Cuong Danh Do, Kok-Seng Wong

    Published 2022-01-01
    “…This paper proposes a two-hop communication protocol with a dynamic resource allocation strategy to investigate the possibility of bandwidth allocation from a limited network resource to the maximum number of clients participating in FL. …”
    Get full text
    Article
  3. 923

    Dynamic Adaptation for Independent Task Scheduling Using Dynamic Programming in Multiprocessor Systems by Lotfi BENDIAF, Ahmed HARBOUCHE, Mohammed Amin TAHRAOUI

    Published 2025-03-01
    “…Efficient scheduling requires optimizing competing objectives, such as minimizing makespan and maximizing processor utilization, to ensure that resources are used effectively. In this work, we propose DYnamic Task Allocation using dynamic programminG (DyTAg), a task scheduling algorithm based on dynamic programming, designed to support dynamic adaptation in HCS. …”
    Get full text
    Article
  4. 924

    Content-based dynamic superframe adaptation for Internet of Medical Things by Yousaf Zia, Arshad Farhad, Faisal Bashir, Kashif Naseer Qureshi, Ghufran Ahmed

    Published 2020-02-01
    “…This article presents a content-based dynamic superframe adaptation algorithm for the low-powered Internet of Medical Things devices to address the resource utilization challenges. …”
    Get full text
    Article
  5. 925

    Identification of patients at risk of new onset heart failure: Utilizing a large statewide health information exchange to train and validate a risk prediction model. by Son Q Duong, Le Zheng, Minjie Xia, Bo Jin, Modi Liu, Zhen Li, Shiying Hao, Shaun T Alfreds, Karl G Sylvester, Eric Widen, Jeffery J Teuteberg, Doff B McElhinney, Xuefeng B Ling

    Published 2021-01-01
    “…<h4>Conclusions</h4>Utilizing machine learning modeling techniques on passively collected clinical HIE data, we developed and validated an incident-HF prediction tool that performs on par with other models that require proactively collected clinical data. Our algorithm could be integrated into other HIEs to leverage the EMR resources to provide individuals, systems, and payors with a risk stratification tool to allow for targeted resource allocation to reduce incident-HF disease burden on individuals and health care systems.…”
    Get full text
    Article
  6. 926

    Optimization strategies in NOMA-based vehicle edge computing network by Jianbo DU, Nana XUE, Yan SUN, Jing JIANG, Shulei LI, Guangyue LU

    Published 2021-03-01
    “…Nowadays, vehicular network is confronting the challenges to support ubiquitous connections and vast computation-intensive and delay-sensitive smart service for numerous vehicles.To address these issues, non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) are considered as two promising technologies by letting multiple vehicles to share the same wireless resources, and the powerful edge computing resources were adopted at the edge of vehicular wireless access network respectively.A NOMA-based vehicular edge computing network was studied.Under the condition of guaranteeing task processing delay, the joint optimization problem of task offloading, user clustering, computing resource allocation and transmission power control was proposed to minimize the task processing cost.Since the proposed problem was difficult to solve, it was divided into sub-problems, and a low-complexity and easy-to-implement method was proposed to solve it.The simulation results show that compared with other benchmark algorithms, the proposed algorithm performs well in minimizing costs.…”
    Get full text
    Article
  7. 927

    Optimization strategies in NOMA-based vehicle edge computing network by Jianbo DU, Nana XUE, Yan SUN, Jing JIANG, Shulei LI, Guangyue LU

    Published 2021-03-01
    “…Nowadays, vehicular network is confronting the challenges to support ubiquitous connections and vast computation-intensive and delay-sensitive smart service for numerous vehicles.To address these issues, non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) are considered as two promising technologies by letting multiple vehicles to share the same wireless resources, and the powerful edge computing resources were adopted at the edge of vehicular wireless access network respectively.A NOMA-based vehicular edge computing network was studied.Under the condition of guaranteeing task processing delay, the joint optimization problem of task offloading, user clustering, computing resource allocation and transmission power control was proposed to minimize the task processing cost.Since the proposed problem was difficult to solve, it was divided into sub-problems, and a low-complexity and easy-to-implement method was proposed to solve it.The simulation results show that compared with other benchmark algorithms, the proposed algorithm performs well in minimizing costs.…”
    Get full text
    Article
  8. 928

    Task Scheduling in Cloud Environment&#x2013;Techniques, Applications, and Tools: A Systematic Literature Review by Olanrewaju L. Abraham, Md Asri Bin Ngadi, Johan Bin Mohamad Sharif, Mohd Kufaisal Mohd Sidik

    Published 2024-01-01
    “…Cloud computing has become a revolutionary model for providing computational resources and services via the internet. As the volume of tasks and the dynamic nature of cloud resources increase, several critical challenges emerge, including load balancing, resource utilization, task allocation, and system performance. …”
    Get full text
    Article
  9. 929

    Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines by Guang-Qian Zhang, Jian-Jun Wang, Ya-Jing Liu

    Published 2014-01-01
    “…m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost. …”
    Get full text
    Article
  10. 930

    Study on multi-satellite cooperative spectrum cognitive method integrating Stackelberg game and federated learning by Xiaojin DING, Yehui XU, Wen BAO, Gengxin ZHANG

    Published 2024-02-01
    “…To solve the problem of the weak spectrum-cognitive ability caused by monitoring angle, direction resolution, limited processing ability and peak power for a low-earth-orbit (LEO) satellite, a multi-satellite cooperative spectrum cognitive method integrating Stackelberg game and federated learning was proposed.Firstly, considering the available computing resource, cognitive performance, processing and transmission delay of each spectrum cognitive satellite, a cooperative-satellite selection and computing-resource allocation algorithm was built for multiple spectrum-cognitive tasks.Secondly, based on the selected satellites and the allocated computing resources, a low-complexity multi-satellite cooperative spectrum cognitive strategy was further designed, which could automatically sense the spectrum holes, and detect interference as well as identify the modulation mode.Simulation results demonstrate that compared to the single-node cognitive method, the designed multi-satellite cooperative spectrum cognitive strategy can obtain a better cognitive performance.Moreover, comparing with the existing model, the model utilized in the designed strategy can effectively achieve 96.69% and 93.32% lower number of parameters and required floating point operations per second, whilst maintaining the performance.…”
    Get full text
    Article
  11. 931

    Gemini: A Cascaded Dual-Agent DRL Framework for Task Chain Planning in UAV-UGV Collaborative Disaster Rescue by Mengxuan Wen, Yunxiao Guo, Changhao Qiu, Bangbang Ren, Mengmeng Zhang, Xueshan Luo

    Published 2025-07-01
    “…Specifically, this framework comprises a chain selection agent and a resource allocation agent: The chain selection agent plans paths for task chains, and the resource allocation agent distributes platform loads along generated paths. …”
    Get full text
    Article
  12. 932

    Interference Mitigation in mmWave Heterogeneous Cloud-Radio Access Network: For Better Performance and User Connectivity by Najwan M. Swadi, Firas A. Sabir, Hamed S. Al-Raweshidy

    Published 2024-01-01
    “…It integrates User-RRH associations to mitigate interference, enhance network throughput (via Heuristic Algorithm) and RRH-BBU clustering (via k-means) to manage resources in the network. …”
    Get full text
    Article
  13. 933

    Integrating Machine Learning for Enhanced Agricultural Productivity: A Focus on Bananas and Arecanut in the Context of India’s Economic Growth by B. S. Saruk, G. Mokesh Rayalu

    Published 2024-10-01
    “…Assist yield projections may provide governments and policymakers with valuable information to make well-informed choices about food security, import–export policies, and resource allocation. It facilitates national- and regional-level food supply planning. …”
    Get full text
    Article
  14. 934

    Deep Learning-Driven Geospatial Modeling of Elderly Care Accessibility: Disparities Across the Urban-Rural Continuum in Central China by Yi Yu, Tian Dong

    Published 2025-04-01
    “…Taking Changsha as a case study, this research constructs an accessibility evaluation system based on the 15-min life circle theory, utilizing multi-source data. Spatial weighting characteristics of elderly care facility locations were analyzed through machine learning algorithms, and service coverage disparities between urban districts and suburban towns were assessed under 5-, 10-, and 15-min walking thresholds. …”
    Get full text
    Article
  15. 935

    Genomic selection optimization in blueberry: Data‐driven methods for marker and training population design by Paul Adunola, Luis Felipe V. Ferrão, Juliana Benevenuto, Camila F. Azevedo, Patricio R. Munoz

    Published 2024-09-01
    “…Our contribution in this study is threefold: (i) for the genotyping resource allocation, the use of genetic data‐driven methods to select an optimal set of markers slightly improved prediction results for all the traits; (ii) for the long‐term implication, we carried out a simulation study and emphasized that data‐driven method results in a slight improvement in genetic gain over 30 cycles than random marker sampling; and (iii) for the phenotyping resource allocation, we compared different optimization algorithms to select training population, showing that it can be leveraged to increase predictive performances. …”
    Get full text
    Article
  16. 936

    Enabling Power Systems With SQKD in Presence of Remote Nodes by Mariam Gado, Muhammad Ismail

    Published 2025-01-01
    “…Due to the complexity of the allocation problem, this paper develops algorithms based on Density-Based Spatial Clustering of Applications with Noise algorithm (DBSCAN), Dijksra&#x2019;s algorithm and genetic algorithms. …”
    Get full text
    Article
  17. 937

    Dynamic Subchannel Assignment-Based Cross-Layer MAC and Network Protocol for Multihop Ad Hoc Networks by Khanh Nguyen Quang, Van Duc Nguyen, Hyunseung Choo

    Published 2013-01-01
    “…The proposed dynamic sub-channel assignment algorithm provides a new interference avoidance mechanism which solves several drawbacks of existing radio resource allocation techniques in wireless networks using OFDMA/TDD, such as the hidden node and exposed node problems, mobility, and cochannels interference in frequency (CCI). …”
    Get full text
    Article
  18. 938

    Intelligent scheduling mechanism of time-sensitive network modal in polymorphic network by Sijin YANG, Lei ZHUANG, Yu SONG, Jiaxing WANG, Xinyu YANG

    Published 2022-05-01
    “…For the problems of uncertain forwarding scheduling and long solving time of time-sensitive network modal in polymorphic network, a joint routing and scheduling mechanism of time-sensitive network modal based on CSQF was proposed.Considering the requirement of bounded delay, network state and different routing mechanisms, a hybrid resource scheduling problem of joint cache queue and routing was formulated to optimize the resource usage of the entire network.Then, the traffic characteristics and cache queue utilization was used to predict the cache utilization of the next cycle, which was based on deep reinforcement learning.In addition, by using multi-queue CSQF forwarding scheduling mechanism and explicit routing algorithm based on cache utilization, an iterative scheduling algorithm was proposed to achieve deterministic forwarding and resource allocation.Simulation results show that the mechanism can effectively adjust the transmission scheduling of deterministic applications according to the resource usage of the network, and has better schedulability compared with other off-line scheduling mechanisms.…”
    Get full text
    Article
  19. 939

    Intelligent scheduling mechanism of time-sensitive network modal in polymorphic network by Sijin YANG, Lei ZHUANG, Yu SONG, Jiaxing WANG, Xinyu YANG

    Published 2022-05-01
    “…For the problems of uncertain forwarding scheduling and long solving time of time-sensitive network modal in polymorphic network, a joint routing and scheduling mechanism of time-sensitive network modal based on CSQF was proposed.Considering the requirement of bounded delay, network state and different routing mechanisms, a hybrid resource scheduling problem of joint cache queue and routing was formulated to optimize the resource usage of the entire network.Then, the traffic characteristics and cache queue utilization was used to predict the cache utilization of the next cycle, which was based on deep reinforcement learning.In addition, by using multi-queue CSQF forwarding scheduling mechanism and explicit routing algorithm based on cache utilization, an iterative scheduling algorithm was proposed to achieve deterministic forwarding and resource allocation.Simulation results show that the mechanism can effectively adjust the transmission scheduling of deterministic applications according to the resource usage of the network, and has better schedulability compared with other off-line scheduling mechanisms.…”
    Get full text
    Article
  20. 940

    Rescheduling of Multi-Scenario and Multi-Objective Dynamic Changes of Ship Group Construction by ZHANG Aoyuan, HU Xiaofeng, ZHANG Yahui

    Published 2025-04-01
    “…First, the objective function is selected based on different production stage and abnormal disturbance, and a mathematical model is then developed, incorporating site constraints, task precedence constraints, and human resource constraints. Next, a site allocation algorithm is introduced, and an improved non-dominated sorting algorithm based on reference points is adopted to solve the problem. …”
    Get full text
    Article