Search alternatives:
many » may (Expand Search)
Showing 201 - 220 results of 4,135 for search 'many algorithm', query time: 0.13s Refine Results
  1. 201

    A Fast Map Merging Algorithm in the Field of Multirobot SLAM by Yanli Liu, Xiaoping Fan, Heng Zhang

    Published 2013-01-01
    “…In this paper, a map merging algorithm based on virtual robot motion is proposed for multi-robot SLAM. …”
    Get full text
    Article
  2. 202

    False Matches Removing in Copy-Move Forgery Detection Algorithms by muthana salih mahdi, Saad N. Alsaad

    Published 2020-03-01
    “…This paper presents an algorithm of the Copy-Move forgery detection using the SIFT algorithm with an effective method to remove the false positives by rejecting all key-points in matches list that own a neighbor less than the threshold. …”
    Get full text
    Article
  3. 203

    SWR: Smartness Provided by Simple, Efficient, and Self-Adaptive Algorithm by Mujdat Soyturk, Deniz Turgay Altilar

    Published 2012-02-01
    “…In this paper, a novel routing algorithm, stateless weight routing (SWR), is proposed. …”
    Get full text
    Article
  4. 204

    Automated Correctness Proof of Algorithm Variants in Elliptic Curve Cryptography by M. . Anikeev, F. . Madlener, A. . Schlosser, S. A. Huss, C. . Walther

    Published 2010-12-01
    “…The Elliptic Curve Cryptography (ECC) is widely known as secure and reliable cryptographic scheme. In many situations the original cryptographic algorithm is modified to improve its efficiency in terms like power consumption or memory consumption which were not in the focus of the original algorithm. …”
    Get full text
    Article
  5. 205

    A Source Aware Scheduling Algorithm for Time-Optimal Convergecast by Jing Zhao, Yajuan Qin, Dong Yang, Ying Rao

    Published 2014-06-01
    “…In order to achieve the lower bound derived by theoretical analysis, we proposed a source aware scheduling algorithm for general network. For IWSNs with a fixed number of available channels, we present a source aware scheduling algorithm with constrained channel. …”
    Get full text
    Article
  6. 206

    Credit card fraud detection through machine learning algorithm by Agyan Panda, Bharath Yadlapalli, Zhi Zhou

    Published 2021-09-01
    “…To help fraud investigators, more algorithms are turning to powerful machine learning methodologies. …”
    Get full text
    Article
  7. 207

    Study of intelligent game adversarial algorithms and their applications in the intelligence field by LIU Geng, LIU Xing

    Published 2024-12-01
    “…Intelligent game adversarial algorithms not only make full use of the portrayal accuracy of the game model, but also solve the equilibrium solution through the powerful computational ability of neural network and the trial-and-error mechanism of reinforcement learning, which makes the intelligent game adversarial algorithms achieve good results in many fields. …”
    Get full text
    Article
  8. 208

    Moving Target Oriented Opportunistic Routing Algorithm in Vehicular Networks by Yu Ding, Wendong Wang, Yong Cui, Xiangyang Gong, Bai Wang

    Published 2013-04-01
    “…In this paper, we propose a moving target oriented opportunistic routing algorithm in vehicular networks for message delivery from information source to a moving target vehicle. …”
    Get full text
    Article
  9. 209
  10. 210

    Efficient i-DFA construction algorithm based on state grouping by Deng-ke QIAO, Qing WANG, Ting-wen LIU, Yong SUN, Li GUO

    Published 2013-08-01
    “…Regular expression matching plays an important role in many network and security applications.DFA is the preferred representation to perform regular expression matching in high-speed network,because of its high and stable matching efficiency.However,DFA may experience state explosion,and thus consume huge memory space.As a classical solution for the problem of state explosion,i-DFA can reduce the memory consumption significantly and guarantee the worst matching performance at the same time.However,prior methods are inefficient in both time and space during the construction of i-DFA.An efficient i-DFA construction algorithm based on the idea of state grouping was proposed.Furthermore,a formal description for the problem of state grouping was given,and it was proved that it was NP-hard to get the best state grouping result.Thus,based on local search strategy,a near-optimal algorithm was introduced to divide states into different groups.Compared with the classical construction method,the significant improvement in both time and space is achieved; the i-DFA of the proposed method may have 2/3 states as that of prior method and the proposed i-DFA is constructed with only 1/16 time of it.…”
    Get full text
    Article
  11. 211

    Majorisation‐minimisation algorithm for optimal state discrimination in quantum communications by Neel Kanth Kundu, Prabhu Babu, Petre Stoica

    Published 2024-12-01
    “…However, solving the SDP can represent a high computational burden for many real‐time quantum communication systems. To address this issue, a majorisation‐minimisation (MM)‐based algorithm, called Quantum Majorisation‐Minimisation (QMM) is proposed for solving the QSD problem. …”
    Get full text
    Article
  12. 212

    A Prospective Study on Algorithms Adapted to the Spatial Frequency in Tomography by Vincent Israel-Jost, Philippe Choquet, André Constantinesco

    Published 2006-01-01
    “…The use of iterative algorithms in tomographic reconstruction always leads to a frequency adapted rate of convergence in that low frequencies are accurately reconstructed after a few iterations, while high frequencies sometimes require many more computations. …”
    Get full text
    Article
  13. 213

    A quantum multiplier based on the quantum Fourier transform algorithm by Qian Junkai, Zhu Jialiang, Ye Bin

    Published 2022-03-01
    “…Multiplier is one of the basic units in many quantum algorithms. In order to implement the multiplying operations and use as few auxiliary qubits in the quantum circuit as possible, a quantum multiplier based on the quantum Fourier transform is proposed. …”
    Get full text
    Article
  14. 214

    Overhaul Scheduling Approach for Metro Vehicles Based on Genetic Algorithms by WANG Bingjing, LI Bingxin

    Published 2023-02-01
    “…It is necessary to schedule overhaul of metro vehicles in consideration of many factors, such as maintenance positions, equipment and manpower. …”
    Get full text
    Article
  15. 215

    A high precision arctangent solution based on CORDIC algorithm by Zhong Yali, Wu Junhui, Liu Xuan, Gao Ping, Duan Xiaohui

    Published 2022-01-01
    “…The traditional CORDIC(Coordinate Rotation Computer) algorithm has many iterations, slow convergence speed, and large resource consumption for high-precision arctangent. …”
    Get full text
    Article
  16. 216

    Cryptanalysis of an Image Encryption Algorithm Using DNA Coding and Chaos by Yuzhuo Zhao, Qiqin Shi, Qun Ding

    Published 2025-01-01
    “…In recent years, many chaotic image encryption algorithms have been cracked by chosen plaintext attack. …”
    Get full text
    Article
  17. 217

    An Optimal Algorithm for Renewable Energy Generation Based on Neural Network by Weihua Zhao, Imran Khan, Shelily F. Akhtar, Mujahed Al-Dhaifallah

    Published 2022-01-01
    “…The results show that the proposed algorithm has technological applications and may greatly improve prediction accuracy.…”
    Get full text
    Article
  18. 218

    Medical Image Classification Using Different Machine Learning Algorithms by Sami Ismael, Shahab Kareem, Firas Almukhtar

    Published 2020-05-01
    “…Each algorithm results are compared to select the best one according to different criteria’s.…”
    Get full text
    Article
  19. 219
  20. 220

    Topology of Complex Networks and Performance Limitations of Community Detection Algorithms by Muhammad Qasim Pasta, Faraz Zaidi

    Published 2017-01-01
    “…One of the most widely studied problems in the analysis of complex networks is the detection of community structures. Many algorithms have been proposed to find communities but the quest to find the best algorithm is still on. …”
    Get full text
    Article