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 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...
In this paper, we present a cache oblivious efficient data structure to solve the two dimensional variant of the Range Minimum/Maximum Query (RMQ) problem.
This paper presents an efficient O(n3) time algorithm for solving the seeded tree alignment problem that finds the similarity score of two RNA secondary structures. In the seeded tree alignment problem, a large tree, representing an RNA secondary structure, is converted into a small tree known as seeded tree. After conversion, a comparison operation is being placed to find the similarity score of...
Given a connected graph G = (V,E), a set Vr ⊆ V of r special vertices, four distinct base vertices u1, u2, u3, u4 ∈ V and four natural numbers r1, r2, r3, r4 such that Σj=14 rj = r, we wish to find a partition V1, V2, V3, V4 of V such that Vi contains ui and ri vertices from Vr, and Vi induces a connected subgraph of G for each i, 1 ≤ i ≤ 4. We call a vertex in Vr a resource vertex and the problem...
Data mining refers to extracting or ldquominingrdquo knowledge from large amounts of data. Thus, it plays an important role in extracting spatial patterns and features. It is an essential process where intelligent methods are applied in order to extract data patterns. In this paper, we have proposed a technique with which it is possible to detect whether a given data set is erroneous. Furthermore,...
The facility of an Augmented Lagrangian (ALAG) multiplier based nonlinear programming technique is demonstrated for minimum- weight design optimizations of boost and buck-boost power converters. Certain important features of ALAG are presented in the framework of a comprehensive design example for buck-boost power converter design optimization. The study provides refreshing design insight of power...
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.