To address the issue of unpractical and inefficient terrain page searching in terrain scheduling of flight simulations, we studied the scheduling problem for further optimization. Firstly the page format organization using the holding-boundary idea was introduced, which well disposed of the rendering sub-problem in scheduling. Then based on the organized pages, we proposed the branch-and-bound ...

In this paper we propose a fast algorithm for the bivariate interpolation of large scattered data sets. It is based on the Partition of Unity Method (PUM) [3] and involves radial basis functions as local approximants. The PUM algorithm is efficiently implemented and optimized by connecting the method itself with an effective cell-based searching procedure. More precisely, we construct a cell st...

How should the efficiency of searching for real objects in real scenes be measured? Traditionally, when searching for artificial targets, e.g., letters or rectangles, among distractors, efficiency is measured by a reaction time (RT) × Set Size function. However, it is not clear whether the set size of real scenes is as effective a parameter for measuring search efficiency as the set size of art...

In order to solve the low searching efficiency in the peer-to-peer (P2P) network, introduce the ant colony algorithm with the particle swarm optimization in searching procedure. Present a new adaptive search protocol (SACASP) based on the ant colony algorithm with the particle swarm optimization in the Peer-to-Peer Network. The approach simulates the process of the ants’ searching food, and can...

Profile Hidden Markov Model (Profile-HMM) is an efficient statistical approach to represent protein families. Currently, several databases maintain valuable protein sequence information as profile-HMMs. There is an increasing interest to improve the efficiency of searching Profile-HMM databases to detect sequence-profile or profile-profile homology. However, most efforts to enhance searching ef...

The genetic algorithm is of advantages to solve an inversion of complex non-linear geophysical equations. Its multi-point searching is able to find the globally optimal solution and avoid falling into a local extremum. The searching efficiency of the genetic algorithm is a key to successfully resolve a geophysical inversion problem in a huge model space with multi-parameters. Encoding mechanism...

In this paper, we consider the problem of searching for a source that releases particles in a turbulent medium with searchers having binary sensors and limited space perception. To this aim, we extend an information-theoretic strategy, namely Mapless, to multiple searchers and demonstrate its efficiency both in simulation and robotic experiments. The search time is found to decay as 1/n for n c...