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...
The degree Δ-closest phylogenetic 2nd root problem (ΔCPR2) is an NP-hard problem concerning phylogenetic tree reconstruction from a graph representing the similarities of the species concerned. Here we present an approximation algorithm for this problem for any fixed Δ >; 3. When |V| >; 3Δ - 1, our algorithm yields an approximation ratio of max((Δ-2)/α, 2), where α >; 1 is a constant whose...
In this paper least square (LS) and linear minimum mean square error (LMMSE) channel estimation (CE) techniques are presented for long term evolution (LTE) single carrier-frequency division multiplexing (SC-FDMA) systems. The main purpose of LTE is to increases data rate but energy utilization both on the mobile terminal as well as network side is important. For doing this, major challenges for LTE...
Cognitive radio (CR) has been proposed as a promising and effective technology to improve radio spectrum utilization. The primary objective of the CR is to handle the non-interference rules with any primary users (PUs). Highly sensitive and optimal spectrum sensing detectors are required in order to avoid harmful interference to PUs. Multitaper spectrum seems to be the most appealing one for spectrum...
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...
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.