The phrase "global search capability" is grammatically correct and can be used in written English.
You can use it when discussing a system or tool that allows users to search for information across all available sources, regardless of geographic location. Example: Our new database has a powerful global search capability that allows users to quickly find relevant information from any of our international branches.
Under the searching structure, PSO enhances the global search capability and search efficiency.
In OCS, the global search capability is dominated by the combination of two different random distributions.
To get rid of local minima and improve global search capability are ensured via this distribution in the basic PSO.
The PDSO procedure is based on a decline demographic model and shows high global search capability with reduced computational costs.
Shuffled frog-leaping algorithm (SFLA) is a newly developed memetic meta-heuristic evolutionary algorithm with good global search capability.
The proposed h-FAPS technique takes the advantage of global search capability of FA and local search facility of PS.
A novel Cauchy mutated cat swarm optimization (CMCSO) that features effective global search capabilities with fast convergence is introduced in this paper.
The result is a tool which combines the global search capabilities of stochastic algorithms with the pattern recognition and tuning abilities of the user.
A tent chaotic map is employed for the adaptation of the acceleration coefficients, thus improving the proposed algorithm's robustness and global search capabilities.
In contrast with the existing evolutionary algorithms (EAs), by representing a path as an OST, the designed SA provides an entirely new searching mechanism in sense of "search from a paths set to another paths set" such that both of its local and global search capabilities are greatly improved.
By encoding a path as an OST, in contrast with the existing evolutionary algorithms (EA) for shortest path problem (SPP), the designed GA provides a "search from a paths set to another paths set" mutation mechanism such that both of its local search and global search capabilities are greatly improved.
