Showing 1 - 18 results of 18 for search '(( binary used whole optimization algorithm ) OR ( binary data processing maximization algorithm ))', query time: 0.65s Refine Results
  1. 1
  2. 2

    Proposed Algorithm. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  3. 3
  4. 4
  5. 5
  6. 6

    An Example of a WPT-MEC Network. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  7. 7

    Related Work Summary. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  8. 8

    Simulation parameters. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  9. 9

    Training losses for N = 10. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  10. 10

    Comparisons between ADAM and NADAM optimizers. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  11. 11

    Normalized computation rate for N = 10. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  12. 12

    Summary of Notations Used in this paper. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  13. 13

    <i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

    Published 2023
    “…The sequences can include from a single SNP-allele pair up to a maximum number of pairs defined by the user (<i>l</i><sub>max</sub>). <b>(C)</b> The whole training data is then scanned, searching for these sequences and deriving a re-encoded dataset where interaction terms are binary features (i.e., 1 if sequence <i>i</i> is observed in <i>j</i>-th patient genotype, 0 otherwise). …”
  14. 14
  15. 15

    Contextual Dynamic Pricing with Strategic Buyers by Pangpang Liu (18886419)

    Published 2024
    “…<p>Personalized pricing, which involves tailoring prices based on individual characteristics, is commonly used by firms to implement a consumer-specific pricing policy. In this process, buyers can also strategically manipulate their feature data to obtain a lower price, incurring certain manipulation costs. …”
  16. 16

    Data_Sheet_1_Alzheimer’s Disease Diagnosis and Biomarker Analysis Using Resting-State Functional MRI Functional Brain Network With Multi-Measures Features and Hippocampal Subfield... by Uttam Khatri (12689072)

    Published 2022
    “…Similarly, from sMRI, we calculated the hippocampal subfield and amygdala nuclei volume using Freesurfer (version 6). Finally, we implemented and compared the different feature selection algorithms to integrate the structural features, brain networks, and voxel features to optimize the diagnostic identifications of AD using support vector machine (SVM) classifiers. …”
  17. 17

    Spectral estimation of large stochastic blockmodels with discrete nodal covariates by Angelo Mele (10809478)

    Published 2022
    “…We show that computing our estimator is much faster than standard variational expectation–maximization algorithms and scales well for large networks. …”
  18. 18

    Seed mix selection model by Bethanne Bruninga-Socolar (10923639)

    Published 2022
    “…The genetic algorithm then operated over 1000 iterations, applying crossover and mutation processes to optimize bee richness. …”