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...
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 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...
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...
The permutation flow shop problem (PFSSP) is a well-known difficult combinatorial optimization problem. In this paper, we present a new hybrid optimization algorithm named SIGSA to solve the PFSSP. This algorithm is composed by the LRV rule, SA-based local search and IIS-based local search. First, to make GSA suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous...
The problem of constructing optimal test strategy to diagnose permanent faults in electronic and electromechanical systems is considered. The test strategy problem is formulated as an optimal binary decision construction problem, whose solution is known to be NP-complete. Our approach integrates information gain of test into heuristic search methods to subdue the computational explosion of the optimal...
This paper presents a novel grouping harmony search algorithm for solving the no-wait flow shop scheduling problems with total flow time criteria. Flow-shop scheduling problem (FSSP) is a typical NP-hard combinational optimization. Firstly, the HS optimization mechanism and FSSP is presented and the total flow time is calculated by a novel method. Secondly, a largest-order-value rule is used to transform...
This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of caving degree (CD) algorithm and variable neighborhood descent (VND) algorithm. More precisely, the first constructive phase is based on a caving degree (CD) heuristic developed for the single container loading problem. In the second improvement phase, four new moves are designed...
In this paper sequence of execution of algorithms are explained visually in an interactive manner. It helps to realize the fundamental concept of algorithms such as searching and sorting method in a simple manner. Visualization gains more attention than theoretical study and it is an easy way of learning process. We propose methods for finding runtime of each algorithm and aims to overcome the drawbacks...
Quality-of-Service Multicast routing is a well-known NP-complete problem as constrained Steiner tree problem, which has various real-time multimedia applications in highspeed networks. The bandwidth-delay-constrained least-cost multicast routing algorithms based on Tabu Search are proposed in this paper. These algorithms can improve the search speed, and make a better solution by using one of the...
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of program elements to scratchpad memory is performed at compile time leading to predictable memory access latencies. Current scratchpad memory allocation techniques mainly improve the average-case execution time of tasks. For hard real-time systems, however, worst case execution time (WCET) is...
The paper describes greedy algorithm, the knapsack problem and itpsilas their related theory, In order to achieve the greatest scope of students benefits and improving the efficiency of the use of the laboratory. It puts forward a dynamic programming algorithm of the three value models based on greedy algorithm. Via the combined value of three model and weight proportion parameter settings, the relevant...
In this paper, we propose tow lower bounds for the problem of scheduling N-independent jobs on a single machine to minimize the sum of early and tardy costs. Jobs have distinct due dates and processing times with earliness and tardiness costs. The problem is proved to be NP-hard. A simple local search algorithm is presented in order to derive an upper bound for the problem and tested the proposed...
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.