Showing 1,541 - 1,560 results of 5,934 for search '(while OR whole) optimize algorithm', query time: 0.15s Refine Results
  1. 1541

    Hybrid Estimation of Distribution Algorithm for Solving Three-Stage Multiobjective Integrated Scheduling Problem by Chao Deng, Rong Hu, Bin Qian, Huai P. Jin

    Published 2021-01-01
    “…A variable neighborhood hybrid operation based on the speed scheduling set is designed in Local Search II to further improve the quality of the solution while balancing the optimization goals. Finally, simulations and comparisons show the efficiency of the proposed HEDA_VNS.…”
    Get full text
    Article
  2. 1542

    Comparative Study of Algorithms for the Conversion From Surface Mesh Models to Volume Mesh Models by Youxi Wang, Qi Pang, Meng Li, Yang Liu

    Published 2024-01-01
    “…The Delaunay algorithm performed best in terms of efficiency and model size, while the Frontal algorithm had an advantage in model refinement. …”
    Get full text
    Article
  3. 1543

    A clustering algorithm based on grids for core data and adjacency relationships for edge data by Honglei He

    Published 2025-05-01
    “…To address these issues, existing research primarily focuses on three directions: (1) optimizing the adaptive selection of grid parameters, which struggles to handle variations in cluster density; (2) improving grid division methods (e.g., multi-granularity or dynamic grids), which have limited effectiveness on complex-shaped data; and (3) integrating other clustering techniques, which enhances accuracy but increases algorithmic complexity. …”
    Get full text
    Article
  4. 1544

    An explainable analytical approach to heart attack detection using biomarkers and nature-inspired algorithms by Maithri Bairy, Krishnaraj Chadaga, Niranjana Sampathila, R. Vijaya Arjunan, G. Muralidhar Bairy

    Published 2025-12-01
    “…Fourteen nature-inspired feature selection algorithms were applied to identify the most informative markers while optimizing the predictive models for greater accuracy and reliability. …”
    Get full text
    Article
  5. 1545

    Barcode-free multiplex plasmid sequencing using Bayesian analysis and nanopore sequencing by Masaaki Uematsu, Jeremy M Baskin

    Published 2025-04-01
    “…Long-read sequencing has emerged as a competitor to Sanger sequencing, with the principal benefit that whole plasmids can be sequenced in a single run. …”
    Get full text
    Article
  6. 1546

    Risk of AI Algorithmic Discrimination Embedded in Government Data Governance and Its Prevention and Control by PENG Lihui, ZHANG Qiong, LI Tianyi

    Published 2024-05-01
    “…To address this issue, this study proposed a series of targeted prevention and control measures, including clarifying the principle of algorithmic fairness, formulating industry norms and standards, improving the accountability mechanism and regulatory system, and optimizing the data collection and processing environment, so as to effectively curb the phenomenon of algorithmic discrimination while making full use of the advantages of AI technology, so that AI technology in government data governance can truly benefit the people, and promote social fairness and justice.…”
    Get full text
    Article
  7. 1547

    Stress management with HRV following AI, semantic ontology, genetic algorithm and tree explainer by Ayan Chatterjee, Michael A. Riegler, K. Ganesh, Pål Halvorsen

    Published 2025-02-01
    “…Various techniques like feature selection and dimensionality reduction are explored to improve classification accuracy while minimizing bias. Different machine learning (ML) algorithms, including traditional and ensemble methods, are employed for analyzing both imbalanced and balanced HRV datasets. …”
    Get full text
    Article
  8. 1548

    Construction and Application of Carbon Emissions Estimation Model for China Based on Gradient Boosting Algorithm by Dongjie Guan, Yitong Shi, Lilei Zhou, Xusen Zhu, Demei Zhao, Guochuan Peng, Xiujuan He

    Published 2025-07-01
    “…Key variables were selected through correlation analysis, missing values were interpolated using K-means clustering, and model parameters were systematically optimized via grid search and cross-validation. Among the algorithms tested, LightGBM achieved the best performance (R<sup>2</sup> = 0.992, RMSE = 0.297), demonstrating both robustness and efficiency. …”
    Get full text
    Article
  9. 1549

    Chinese National Condition Based Power Dispatching Optimization in Microgrids by Gang Chen, Jian-Ming Wang, Xiao-Dong Yuan, Liang Chen, Lu-Jia Zhao, Yu-Ling He

    Published 2018-01-01
    “…This paper proposed a study on the power dispatching optimization in the microgrid aiming at Chinese national condition based on PSO algorithm. …”
    Get full text
    Article
  10. 1550

    AVS3 intra frame prediction parallel algorithm based on minimum CU cost by ZHANG Quan, WANG Shun, LIU Yangyi, DUAN Chang, PENG Bo

    Published 2025-02-01
    “…To address the time-consuming issue of audio video coding standard 3(AVS3) intra frame prediction, an intra frame prediction parallel algorithm based on the cost of the minimum coding unit (CU) was proposed. …”
    Get full text
    Article
  11. 1551

    Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios by Geng CHEN, Zhiwei XING, Fei SHEN, Qingtian ZENG

    Published 2024-02-01
    “…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
    Get full text
    Article
  12. 1552

    Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios by Geng CHEN, Zhiwei XING, Fei SHEN, Qingtian ZENG

    Published 2024-02-01
    “…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
    Get full text
    Article
  13. 1553

    Comparing Geodesic Filtering to State-of-the-Art Algorithms: A Comprehensive Study and CUDA Implementation by Pierre Boulanger, Sadid Bin Hasan

    Published 2025-05-01
    “…Additionally, we present a highly optimized GPU implementation featuring innovative wave-propagation algorithms and memory access optimization techniques that achieve a 200× speedup, making geodesic filtering practical for real-time applications. …”
    Get full text
    Article
  14. 1554

    Combining 3-Opt and Improved Discrete Cuckoo Search Algorithm for the Traveling Salesman Problem by A. Sarucan, M. F. Berkaya

    Published 2024-01-01
    “…In terms of processing time, the average time of the proposed algorithm was 11.46 seconds, while the average time of the improved discrete CSA was 92.86 seconds. …”
    Get full text
    Article
  15. 1555

    An Improved KF-RBF Based Estimation Algorithm for Coverage Control with Unknown Density Function by Lei Zuo, Maode Yan, Yaoren Guo, Wenrui Ma

    Published 2019-01-01
    “…A cost function, depending on the density function and a certain metric, is provided to evaluate the performance of coverage network. Then, while considering the sampling noise, a novel estimation algorithm is developed to approximate the density function based on the Kalman filter (KF) and the Radial Basis Function (RBF) neural network. …”
    Get full text
    Article
  16. 1556
  17. 1557

    Dynamic Emergency Vehicle Path Planning and Traffic Evacuation Based on Salp Swarm Algorithm by X. H. Duan, J. X. Wu, Y. L. Xiong

    Published 2022-01-01
    “…In view of the rescue delay due to traffic congestion in the urban road network, this paper implemented real-time traffic control with congestion index constraints in emergency vehicle dispatching and proposed a two-stage optimization model and algorithm. In the first stage, salp swarm algorithm (SSA) was combined with Dijkstra algorithm, and a novel hybrid algorithm with new updating rules was designed to get the multiple alternative paths. …”
    Get full text
    Article
  18. 1558

    Recognition algorithm of piano playing music notes based on improved hidden Markov model by Ziwei Wang

    Published 2025-09-01
    “…The proposed method optimizes HMM and combines GA-RBF neural network to significantly reduce computational complexity while ensuring accuracy, thereby achieving fast and accurate piano playing music note recognition.…”
    Get full text
    Article
  19. 1559

    Energy-Aware Service Composition Algorithms for Service-Oriented Heterogeneous Wireless Sensor Networks by Tao Wang, Lianglun Cheng, Ke Zhang, Jun Liu

    Published 2014-03-01
    “…With both the energy-aware metrics: energy-aware load-balancing factor and overall energy consumption, we formulate the process of energy-aware sensor service composition into a combinatorial optimization problem; furthermore, an improved discrete particle swarm optimization (IDPSO) algorithm with inertia weights adjustment and extreme perturbation scheme is proposed to solve the combinatorial optimization problem. …”
    Get full text
    Article
  20. 1560

    Direction-assisted enhanced black-winged kite algorithm for mobile robot path planning by Honglin Wan, Qilin Wu, Zhaochun Peng, Zheng Lu

    Published 2025-07-01
    “…Lastly, a novel graph-based integration strategy is proposed to address the issue of how to introduce directional heuristics into the optimization process of the enhanced BKA algorithm (EBKA). …”
    Get full text
    Article