Aiming at improving the global convergence speed of bacterial colony chemotaxis (BCC) optimization algorithm, a new chaotic hybrid bacterial colony chemotaxis (CHBCC) algorithm is introduced through the technique of hybrid algorithm. By integrating elitist strategy and chaotic optimization into bacterial colony chemotaxis optimization algorithm, it greatly enhances the local searching efficienc...

This paper presents the analog macro-cell placement using the novel very fast simulated re-annealing algorithm, which is exponentially faster than the classical Cauchy or Bolzmann annealing. A slide function is applied to convert the absolute placement to relative placement, which greatly decreases the configuration space without degrading the searching opportunity. The cost function is set up ...

The only technique available for solving many important problems is searching. Since searching can be extremely costly, it is important to identify features that improve the efficiency of aearch algorithms. We compute the efficiency of simple backtracking, of an algorithm similar to backtracking except that it notices when the predicate is empty instead of noticing when it is unsatlsfiable (the...

An aggregation service (AgS) is a P2P overlay-tier whose purpose is to aggregate and optimize the searching of services and service components maintained by service providers in a P2P Service Overlay Network (SON). AgS dimensioning takes into account the AgS size, in order to allow it to adequately perform the searching when compared with P2P SON native searching mechanisms. Suitable AgS dimens...

A distributed parallel genetic algorithm based on PC cluster was proposed, aiming at the disadvantage of traditional genetic algorithm, such as the bad searching quality and long computation time. It adopts the improved genetic simulated annealing algorithm and distributed parallel technique MPI, to implement the distributed computing on PC cluster. The algorithm uses the individual migration s...

Focusing on improving quantization performance for signals in non-flat region, the rate-distortion based quantization level adjustment algorithm (RDQLA) was proposed in our former work. It can improve the coding performance efficiently. However, exhaustively searching the optimal quantization level is computationally expensive. In this paper, a fast RDQLA algorithm for H.264 is proposed. By ana...

Problem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficie...

This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and path recording techniques. By means of sorting, we cun identify the correct path in a very fast way and then, by path recording, we can recover the bit sequence without degmding decoding performance. We also develop a c...

Given a text T = t1t2 ... tn and a set of patterns P = {P1, P2, ..., Pr}, the exact multiple string matching problem (EMSMP) finds the ending positions of all sub-strings in T which is equal to Pi for 1  i  r. We regard all substrings in T and patterns in P as data points in an edit distance-based metric space. The data points in T are constructed into a vantage point tree (vp-tree) T. Then, ...