The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we present a revised method to compute the similarity of traditional string edit distance. Given two strings X and Y over a finite alphabet, an edit distance between X and Y can be defined as the minimum weight of transforming X into Y through a sequence of weighted edit operations. Because this method lacks some type of normalization, it would bring some computation errors when the...
In two player games players are in conflict to each other and coalitions are not allowed but in three-player games two players can join their efforts against the third player. As a result, cooperation is a key-factor that deeply affects the complexity of three-player games. In the game of Shove, cooperation can be much more difficult than competition and, as a consequence, three-player Shove played...
Finding the isomorphic graph is the problem that have algorithms with the complexity time. For this in general, because of classification for algorithms time complexity, this solution stay in NP-complete group. In this essay tried to show the new style for DNA algorithms, until decrease the solution of the problem in vast. This style heel show to exploit of graphs Adjacency matrix representation,...
In MPEG-2 to MPEG-4 Simple Profile (SP) transcoder based on the discrete cosine transform (DCT) domain, data conversion from the field DCT to frame DCT must be implemented. We proposed a low-complexity conversion method based on the DCT domain, which does not need performing inverse DCT and DCT. This method exploits the relationship between the filed DCT and the frame DCT on the transform domain to...
For unpredictable manner of mobile ad hoc network (manet), due to mobility of nodes in network, the shortest path is not necessarily the better path. If we do not consider the stability of routing path, then wireless links may be easily broken. Hence it is important to find a route that endures a longer time. Recently, efforts in this field have dealt the parameters battery power or trust of a node...
The layout of aircraft is a complete NP-problem which is difficult to find an optimal solution. In this paper we simplify the issue for the three-dimensional layout. This text raised the issue of a new line of thought is giving pretreatment to the objects of known layout, and then under the artificial problem in every step of the layout of the best ideas for the layout. With the constraint of non-interference...
The distribution network planning is a complex combinatorial optimization problems, Based on the suboptimal solution instead of solving the optimal solution when the time complexity of the problem from the point of view, Adjust the traditional model base on it does not need Solution Accuracy, the distribution network planning problem is divided into two stages. Then using ant colony algorithm search...
An f-coloring of a graph G is a coloring of edges of E(G) such that each color appears at each vertex v ∈ V (G) at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index of G, and denoted by χ'f(G). Any graph G has f-chromatic index equal to Δf (G) or Δf(G)+1, where Λf(G)= maxv∈V{⌈d(v)/f(v)⌉}. If χ'f(G) = Δf(G), then G is of Cf 1; otherwise G is of Cf 2....
This paper discusses an approach to generate all permutations and combinations of valid matching edges, valid pass-through edges and un-matched edges of a Bipartite graph (B-graph). Matchings would range from no-match to perfect-match. B-graph is represented as matrix where rows and columns represent two disjoint sets of vertex and its values represent the edges. It involves 3 stages of operation...
Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an issue which is a special SMC problem. Based on Scalar Product Protocol, Monte Carlo Method and Oblivious Transfer, we give two solutions to the problem about how to decide the areas....
Pipelined operator tree (POT) scheduling is an important problem in the area of parallel query optimization. A POT is a tree with nodes representing query operators that can run in parallel and edges representing communication between adjacent operators that is handled by sending long streams of data in a parallel-pipelined fashion. The problem is to assign operators to processors so as to minimize...
In this article, a novel algorithm-position prediction guide continuously adaptive mean shift procedure (CAMSHIFT)-is proposed for tracking objects in video sequences. CAMSHIFT is incorporated with the position prediction algorithm makes the scale adaptation of CAMSHIFT is improved, tracking efficiency increased and the computation complexity is reduced. Preliminary experimental results show the algorithm...
Many computational programs use nested loops. Programs run faster if they can execute loops in parallel. Therefore nested loops parallelization is an important problem for increasing of speed-up of program executions. One of underlying stages in parallelization is scheduling tiled space for iterating nested loops. As the problem is a NP-Hard one, using traditional search methods for solving such programs...
A new rate control algorithm for H.264 based on histogram of difference is proposed in this paper to improve video distortion due to high motion or scene changes. In addition, a new frame level bits allocation method is proposed instead of equal allocation. Experimental results show that the proposed method have a better performance than the previous ones.
In intelligent surveillance field, the numerous methods have been proposed for foreground extraction from a stationary or dynamic background from a general video sequence. It is very difficult for the proposed methods to have both high accuracy, low computational complexity and less memory requirements. Unlike previous approaches to object detection which detect objects by building adaptive models...
Vehicle Routing Problem is a NP-hard problem. In this paper, the model of Vehicle Routing Problem of multi car is built, then introduces and improves Ant System, which is successfully applied for Vehicle Routing Problem of multi vehicle.
The gene-duplication problem is to infer a species tree from a collection of gene trees. As we know, this problem is NP-hard and thus requires efficient heuristics. Existing heuristics for this problem performs a stepwise search of the tree space which consists of all potential species trees. Each step in heuristics is guided by an exact solution to an instance of local search problem. The local search...
Quasi-cyclic low density parity check (LDPC) codes and rotation LDPC codes are investigated in this paper, based on which, a new class of well-structured LDPC codes are proposed. Additionally, for ease of coding, a dual-diagonal structure is applied to the parity-check matrices of those codes, which ensure that parity-check bits can be recursively calculated with linear computational complexity. With...
Traveling Salesman Problem (TSP) is a kind of classical combinatorial optimization problem that is easy to be described but difficult to be solved. It belongs to NP-hard problem and is applied broadly in practice. Thus rapid and effective solving TSP is very important application value in practice. Genetic Algorithm (GA) is a kind of heuristic global optimization search algorithm that simulates the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.