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, the new alternative method for the determination of the set of all minimal realisations of the positive two-dimensional hybrid linear systems in a second Fornasini-Marchesini (IIF-M) model based on the two-dimensional digraphs theory has been presented. In addition, all realisations in the set are minimal. For the proposed method, parallel computing algorithm was constructed. Algorithm...
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs and study the problem from the algorithmic point of view. For strongly chordal graphs and distance-hereditary graphs, we show that the reverse minus domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees. For chordal graphs...
There are many heuristics to address 2-bin integer partition problem. The range (R) of the values in the data set and the number of element (N) in the data set are 2-parameters which determine the appropriate heuristics. By and large, for large N, Karmarkar-Karp(KK) heuristics offers solutions. For low values of N, Complete Karmarkar-Karp heuristics (CKK), Horowitz and Sahni (HS), Schroeppel and Shamir...
In this paper, we present a new heuristic that generates broadcast schemes in arbitrary networks. The heuristic gives optimal broadcast time for HyperCube, and best results for Cube-Connected Cycles and large Shuffle-Exchange graphs. Extensive simulations show that our new heuristic outperforms the best known broadcast algorithms for two different network models representing Internet generated using...
Testing is an important step of building e-commerce system. In regression testing, it is the key issue that how to reuse the test suite efficiently. This paper presents a dynamic adjustment prioritization based on the design information of test suite which is a new exploration of regression test prioritization. It improves the shortcoming of the existing technologies which failed to use the design...
We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity...
It is well-known that the traditional association rules with time can't be found out in many algorithms. First, according to concept of dynamic association rules, this paper analyzes the disadvantages of traditional association rules. Then, the concepts of dynamic association rules based on sliding windows and the definition of time vector representation of dynamic association rules are put forward...
In this paper, a new algorithm is designed to solve time-cost tradeoff problem. Conventional algorithm is to reduce length of longer paths in activity network first, and then reduce shorter ones step by step. The contrary idea is adopted in the paper, firstly, the activity network is simplified equivalently by using theory of network planning technology and float, and paths which should be considered...
In this paper, we present a new heuristic that generates broadcast schemes in arbitrary networks. The heuristic gives optimal broadcast time for ring, tree and grid if the originator is on the corner. Extensive simulations show that our new heuristic outperforms the best known broadcast algorithms for two different network models representing Internet and ATM networks. It also allows to generate broadcast...
The problem of considering the setup times in scheduling with non-sequence constraint between operations has been researched, but there are no researches on the problem of considering the setup times in processing and assembly integrated scheduling of complex multi-product dynamic scheduling with sequence constraint between operations. So, a complex multi-product dynamic scheduling algorithm is proposed,...
An intersection-centric routing algorithm of traffic simulation system and priority algorithm are proposed by us before. When there are many simulating vehicles, the performance of the system is very crucial. Change the core algorithm may be the way to get better performance. After trying some algorithms, an IBF* algorithm is proposed to fit the requirement of intersection-centric routing based on...
The minimum spanning tree(MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component which is a classic problem in operational research(OR) with important applications in a number of applications, both as a stand-alone problem and as a subproblem in a more complex. The problem considered here is that of determining whether a given spanning tree of a graph...
In this paper we develop algorithms for generating random channel specifications of channel routing problem in VLSI design. A channel is a rectangular routing region containing two sets of fixed terminals on two of its opposite sides and the other two opposite sides (of the rectangle) are open ends, may or may not contain any terminal of a net but the terminal position is not fixed before a routing...
With the remarkable increase in the number of nucleotide and acid sequences, it is necessary to study pattern matching in querying sequence patterns in the biological sequence database. To further raise the performance of the pattern matching algorithm, an improved BM algorithm (called BMBR) is presented. It bases on the method of BM algorithm and combines with the shift function of BR algorithm,...
A three-dimensional (3D) spring modeling algorithm is given for the 3D visualization of graph, which have been implemented in OpenGL. It avoids edge crossings more effectively, and strengthens the sense of tridimensionality and aesthetics of graph while laying out the graph in three dimensions. By the use of interactive computer visualization, we can observe the distributing character of undirected...
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.