Showing 601 - 620 results of 31,575 for search '"algorithm"', query time: 0.13s Refine Results
  1. 601
  2. 602
  3. 603

    Variable Weighted Ordered Subset Image Reconstruction Algorithm by Jinxiao Pan, Tie Zhou, Yan Han, Ming Jiang

    Published 2006-01-01
    “…In the two algorithms, the weighting varies with the geometrical direction of the ray. …”
    Get full text
    Article
  4. 604

    RWA algorithm based on cost of photoelectric conversion device by Daoyun HU, Zhentai YANG, Qianchun LU, Jin QI

    Published 2020-04-01
    “…Over the past decade,carrier operator implement fine-grained traffic scheduling in optical transport network(OTN) by deploying optical-electric conversion(OEO) devices on ROADM,which can improve the spectrum utilization.However,OEO device is very expensive,which will increase the CAPEX and OPEX of carrier operator.A problem about traffic scheduling and the deployment of OEO devices in OTN was proposed.Then,the ILP model of this problem was built and it was proved NP-hard.Additionally,two novel algorithms named OEO-RWA and SA-RWA were proposed.At last,these algorithms were demonstrated can not only ensure flexibility of traffic scheduling,but also can reduce the number of OEO device through simulation.…”
    Get full text
    Article
  5. 605
  6. 606

    An Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems by S. Salcedo-Sanz, J. Del Ser, Z. W. Geem

    Published 2014-01-01
    “…This paper presents a novel fuzzy clustering technique based on grouping genetic algorithms (GGAs), which are a class of evolutionary algorithms especially modified to tackle grouping problems. …”
    Get full text
    Article
  7. 607

    Font Design in Visual Communication Design of Genetic Algorithm by Yue Wang, Won-jun Chung

    Published 2022-01-01
    “…Therefore, this paper studies the font design in the design of the visual algorithm based on the genetic algorithm, and the font design is analyzed by the particle swarming algorithm, the decision MIMO-SCMA system of the genetic algorithm. …”
    Get full text
    Article
  8. 608

    Minimum energy broadcasting algorithm in wireless sensor networks by TANG Yong, ZHOU Ming-tian

    Published 2007-01-01
    “…In order to adjust the transmission power of nodes for minimizing total energy consumption in wireless sensor networks,a new distributed algorithm called ERBOP(enhanced relative neighborhood graph broadcast oriented protocol) was proposed which was an improvement upon RBOP(relative neighborhood graph broadcast oriented protocol) pre-sented by Cartigny et al.In ERBOP,a sub-graph of relative neighborhood graph,which was a sparse connected graph and contains minimum spanning tree,was locally constructed by eliminating long edges.Moreover,1-dominating connected dominating set was constructed basing on the sub-graph,and only the dominating nodes participated in the broadcasting.The simulation results show that ERBOP conserves energy efficiently.…”
    Get full text
    Article
  9. 609

    Virtural Realtime Services:Infrastructure,Algorithms and Evolution Path by Wei Chen

    Published 2015-05-01
    “…Meanwhile,a number of key algorithms for virtual rea1-time service were proposed and analyzed,an evolution path toward virtual rea1-time service along with its major problems was also presented. …”
    Get full text
    Article
  10. 610

    Efficient heuristic algorithm for the mobile sink routing problem by YUAN yuan1, PENG Yu-xing1, LI Shan-shan2, TANG Wen-sheng3

    Published 2011-01-01
    “…In large-scale monitoring region,randomly deployed wireless sensor networks may not be fully connected with high probability.Using mobile sink for data collection is one of the feasible solutions.Mobile sink shortest routing prob-lem can be regarded as a special case of TSP with neighborhoods(TSPN) problem,since the neighborhoods are the radio ranges of the sensor nodes,which can be modeled as possibly overlapped disks with diverse sizes.This kind of TSPN problem has no polynomial algorithms so far.To handle it,a novel approximation algorithm was proposed,which first forms a "racetrack" by utilizing the non-intersecting loop property of TSP routes,and then through the inner lane heuris-tic,the bend heuristic and the shortcut searching,the algorithm can find an approximation solution within O(n2) computa-tion time.The formal proofs and the large-scale simulations all verify that our algorithm can achieve a good approxima-tion ratio and can be more efficient than the related algorithms.…”
    Get full text
    Article
  11. 611
  12. 612

    Novel algorithm for dynamic bandwidth scheduling in WDM EPON by Xue-shun WANG, Shao-hua YU, Jin-you DAI

    Published 2012-02-01
    “…Optical network unit(ONU)grant scheduling techniques for wavelength division multiplexed Ethernet passive optical networks (WDM EPON) was investigated and the grant scheduling problem based on scheduling theory was solved the question was formulated into a rectangle packing problem and a high performance ONU grant scheduling policy based on Euclidian distance was proposed by taking quasi-human strategy.An effective heuristic algorithm was provided to quickly solve ONU grant scheduling problem in WDM EPON.Further simulation experiments show the grant scheduling algorithm can decrease average packet delay and increase network utilization.The results indicate the effectiveness of this algorithm.…”
    Get full text
    Article
  13. 613
  14. 614

    Weapon Target Allocation Based on GA-APSO Algorithm by Qiang-Qiang Xu, Ke-Qi Li, Zhong-Qi Yue, Yong-Qiang Cao, Rui Bai

    Published 2024-01-01
    “…This paper proposes an improved Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) hybrid, referred to as the GA-APSO algorithm, to address the static WTA problem. …”
    Get full text
    Article
  15. 615
  16. 616
  17. 617

    Novel coverage control algorithm for wireless sensor network by HAN Zhi-jie1, WU Zhi-bin2, WANG Ru-chuan3, SUN Li-juan3, XIAO Fu3

    Published 2011-01-01
    “…Firstly,in order to make an effective coverage control of WSN,the algorithm was proposed in WSN called AASR(adaptive adjustment of sensing radius).Through the nodes choose the optimal coverage adaptively,node’s energy consumption could be reduced,and the coverage had been improved efficiency.Secondly,the result was presented in the simulation and analysis from respects of the effect of adjustment,energy consumption,as well as coverage redundancy.The result showes that AASR can effectively improve the survival time,reduce energy consumption,and increase cover-age.…”
    Get full text
    Article
  18. 618

    COMPARATIVE MACHINE LEARNING ALGORITHM FOR CARDIOVASCULAR DISEASE PREDICTION by Ashish Mishra, Jyoti Mishra, Victor Hugo, Aloísio Vieira Lira Neto

    Published 2024-12-01
    “…The proposed method uses the random forest algorithm since it has been shown to be the most effective algorithm for classifying cardiovascular illness.…”
    Get full text
    Article
  19. 619

    Personalized recommendation algorithm based on user behavior analysis by Jun JIA, Bin ZHANG, Zhiyuan LI, Wei WEI, Hao WEI

    Published 2019-12-01
    “…With the development of business intelligence system and data mining technology,user behavior data has an important impact on enterprise decision-making.For the network e-commerce platform,the results of these data analysis can be used to push items of interest to specific users,which can enhance the user experience and the business value of the platform.A personalized recommendation algorithm based on user behavior analysis was proposed,which transforms user behavior information into user rating matrix,and an improved regularized nonnegative matrix decomposition algorithm was also proposed,which adds bias information to the original regularized nonnegative matrix decomposition.This algorithm can fully mine the user behavior information such as click,purchase,browse,collect,etc.…”
    Get full text
    Article
  20. 620