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.
This paper presents an algorithm for searching for Custom Instructions (CI) for Application specific Instruction-set processors (ASIPs) using Simulated Annealing algorithm (SA). A key feature of ASIP design is the ability of defining application specific CI, which are assisting HW modules in the EX phase of the processor that handles patterns of instructions that if handled by HW can improve the performance...
The duplication-loss problem is to infer a species super tree from a collection of gene trees that are confounded by complex histories of gene duplication and loss events. The decision variant of this problem is NP-complete. The utility of this NP-hard problem for large-scale phylogenetic analyses has been largely limited by the high time complexity of existing heuristics. These heuristics aimed at...
Pulse Coupled Neural Network (PCNN) with the phenomena of synchronous pulse bursts is different from traditional artificial neural networks. In this paper, the auto-wave in PCNN is used to solve combination optimization problems. The preventive feedback based on triangle inequality theorem is introduced to prevent bad solutions, and Preventive Feedback Pulse Coupled Neural Network (PFPCNN) is presented...
In video coding, motion estimation is the most time consuming part due to its high computational complexity. Based on the high temporal and spatial correlation of motion vector (MV), a new fast motion estimation algorithm of UMHexagonS (UMH) has been proposed to reduce computational complexity by using relatively few search points without degrading image quality, in which the modified patterns with...
The complexity of technology and structure of equipments increasing significantly raise challenges in equipment diagnosis. Extensive researches make us recognize that Design for Testability (DFT) must be carried out concurrently with functional design of equipments in order to fundamentally solve these problems. Diagnostic strategy design, as an important aspect during DFT, is crucial for reducing...
In this paper, we have proposed a novel algorithm based on Ant Colony Optimization (ACO) for finding near-optimal solutions for the Multi-dimensional Multi-choice Knapsack Problem (MMKP). MMKP is a discrete optimization problem, which is a variant of the classical 0-1 Knapsack Problem and is also an NP-hard problem. Due to its high computational complexity, exact solutions of MMKP are not suitable...
Finding the longest cycle is a novel concept in biochemical feedback loop analysis in systems biology. Biochemical networks are often represented as directed graphs in which vertices represent chemical compounds and edges represent chemical reactions between compounds. Therefore, a biochemical longest feedback loop can be formulated as the longest cycle in a directed graph. Because finding the longest...
The capacitated min-k-cut problem of hypergraphis the problem of partitioning the vertices into k parts, and each part has a different capacity. The objective is to minimize the weight of cut hyper edges. It is an NP-hard problem which is an important problem with extensive applications to many areas, such as VLSI CAD, image segmentation, etc. Although many heuristic algorithms have been developed,...
Motion estimation plays an important role in inter-frame prediction for the video coding standards such as H.264/AVC, MPEG-2, MPEG-4, VC-1, and so on. Its huge computation complexity, however, makes it difficult to achieve real-time coding for the HDTV1080p. In this paper, we propose a dynamic search range algorithm which reduces about 80% of search points in full search algorithm for the H.264/AVC...
In this paper, a new hybrid incremental learning algorithm for Bayesian network structures is proposed. It develops a polynomial-time constraint-based technique to build up a candidate parents set for each domain variable, and a hill climbing search procedure is then employed to refine the current network structure under the guidance of those candidate parents sets. Our algorithm always offers considerable...
In this work, we propose a maximum-likelihood (ML) soft-decision decoding algorithm of linear block codes based on an enhanced tree-based search algorithm. The algorithm considers each codeword as a tree branch and explores the subtree corresponding to the more reliable basis (MRB) of received vectors. By making use of the pre-defined ensemble branches and their costs, the branch evaluation process...
This study propose to extend performance analysis of mainly Brute force and Heuristics algorithms on tree search problems. The most important goal is to look for optimization by punching holes in existing theory. The outcome will give a new dimension to traditional values like formulation of intelligent and speculative searches with improvement in time and space complexities. A series of observations...
In a structured peer-to-peer (p2p) network, key based routing algorithms are used for searching and locating resources in the network. For dynamic and scalable behavior these algorithms suffer from high overhead to maintain large state information of nodes and to keep them up-to-date. To deal with this problem, a Sub-ring Based Chord model and a lookup algorithm are proposed. The lookup process keeps...
QoS routing problem is a typical nonlinear combination optimization problem, which has been proved to be a NP complete problem. According to the defects of solving the problem by Ant Colony Algorithms (ACA), a QoS routing algorithm based on Culture-Ant Colony Algorithms is put forward in this paper. Bringing ACA into the framework of Culture Algorithms, the algorithm adopts the two evolution frame...
According to the research and analysis of auto-generating exam paper issues, identified auto-generating exam paper is a multi-objective constrained optimization problem, this paper puts forward mathematical models for auto-generating paper based on genetic algorithm. In this model, uses the properties of global-selecting-excellent and intelligent search of genetic arithmetic, on the basis of the every...
H.264/AVC is the outstanding and significant video compression standard developed by ITU-T/ISO/IEC Joint Video Team. Motion estimation (ME) plays a key role in H.264/AVC, it concerns greatly on computational complexity especially when using the full search (FS) algorithm. Although many fast ME algorithms have been proposed to reduce the huge calculation complexity instead of FS, the ME still can not...
In H.264 video coding standard, in order to get a higher compression ratio, H.264 adopts hexagon-based search (HEXBS) algorithm to perform motion estimation which has a large calculation. Compared with Full Search algorithm, it reduces the searching time obviously, but it still takes the most time of compression in encoding. Based on the HEXBS, this paper improved the searching algorithm. Our experimental...
Since Volker Strassen proposed a recursive matrix multiplication algorithm reducing the time complexity to n2.81 in 1968, many scholars have done a lot of research on this basis. In recent years, researchers have proposed using computer algorithms to solve fast matrix multiplication problem. They have found Strassen's algorithm or other algorithms that have the same time complexity as Strassen algorithm...
For High Definition (HD) video formats, computational complexity of Full Search (FS) Motion Estimation (ME) algorithm is prohibitively high, whereas the Peak Signal-to-Noise Ratio obtained by fast search ME algorithms is low. Therefore, in this paper, we propose Recursive Dynamically Variable Step Search (RDVSS) ME algorithm for real-time processing of HD video formats. RDVSS algorithm dynamically...
A developed Dijkstra shortest path search algorithm is proposed through improving data structure, preprocessing to remove redundant vertices and setting the search region sequence. The average running time before and after improvement is compared and analyzed through the simulation tests. The results show that the developed Dijkstra shortest path search algorithm can improve storage efficiency and...
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.