Scan Science and Technology

Contact Leading Edge Experts & Companies

14,000,000 Leading Edge Experts on the ideXlab platform

14,000,000

Leading Edge Experts

on the ideXlab platform

Search Algorithm

The Experts below are selected from a list of 339024 Experts worldwide ranked by ideXlab platform

Search Algorithm - Free Register to Access Experts & Abstracts

Russell Kao - One of the best experts on this subject based on the ideXlab platform.

Zhaoyun Xing - One of the best experts on this subject based on the ideXlab platform.

Hua Yuan - One of the best experts on this subject based on the ideXlab platform.

  • Parallel Search Algorithm for Geometric Constraints Solving
    2007 2nd IEEE Conference on Industrial Electronics and Applications, 2007
    Co-Authors: Kong Zhao, Hua Yuan
    Abstract:

    In this paper, we propose a hybrid Algorithm -(parallel Search Algorithm) to solve geometric constraint problems. First, particle swarm optimization is employed to gain parallelization while solution diversity is maintained. Second, simplex method reduces the number of infeasible solutions while solution quality is improved with an operation order Search. Performance results on geometric constraint problems show that parallel Search Algorithm outperforms existing techniques.

Raul Donangelo - One of the best experts on this subject based on the ideXlab platform.

  • Quantum Search Algorithm as an open system
    Physica A: Statistical Mechanics and its Applications, 2007
    Co-Authors: A. Romanelli, A. Auyuanet, Raul Donangelo
    Abstract:

    We analyze the responses of a quantum Search Algorithm to an external monochromatic field and to the decoherences introduced through measurement processes. The external field in general affects the functioning of the Search Algorithm. However, depending on the values of the field parameters, there are zones where the Algorithm continues to work with good efficiency. The effect of repeated measurements can be treated analytically and, in general, does not lead to drastic changes in the efficiency of the Search Algorithm.

  • Quantum Search Algorithm as an open system
    arXiv: Quantum Physics, 2005
    Co-Authors: A. Romanelli, A. Auyuanet, Raul Donangelo
    Abstract:

    We study the quantum Search Algorithm as an open system. More specifically, we analyze the responses of that Algorithm to an external monochromatic field, and to the decoherences introduced by the measurement process. We find that the Search Algorithm is robust with respect to many external interactions.

Kong Zhao - One of the best experts on this subject based on the ideXlab platform.

  • Parallel Search Algorithm for Geometric Constraints Solving
    2007 2nd IEEE Conference on Industrial Electronics and Applications, 2007
    Co-Authors: Kong Zhao, Hua Yuan
    Abstract:

    In this paper, we propose a hybrid Algorithm -(parallel Search Algorithm) to solve geometric constraint problems. First, particle swarm optimization is employed to gain parallelization while solution diversity is maintained. Second, simplex method reduces the number of infeasible solutions while solution quality is improved with an operation order Search. Performance results on geometric constraint problems show that parallel Search Algorithm outperforms existing techniques.