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.
A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is concerned with studying this type of circuit using the available control techniques. It is shown that the underlying problem can be recast as a rank minimization problem that is NP-hard in general. In order to circumvent this difficulty,...
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard...
Multiple sequence alignment is one of the most important and challenging problem in bioinformatics, which is known as NP-hard problem. In this paper, a chaos-differential evolution (CDE) is proposed to solve MSA. In the proposed CDE algorithm, DE and chaos are hybridized to combine the evolutionary searching ability of DE and overcoming local optima of chaotic local search. Simulation shows that novel...
Future military operations will feature network-enabled human soldiers working seamlessly with intelligent, autonomous systems such as sensor networks and unmanned vehicles. In these systems, data aggregation (e.g., data fusion, plan monitoring) and data dissemination (e.g., information sharing) will be essential communication patterns. While ad hoc networks are commonly proposed for complex battlefield...
This paper discusses the controllability problem of Boolean networks with inputs (control nodes) and outputs (controlled nodes). An algorithm for testing controllability is in general NP-hard, and the existing polynomial-time algorithm is limited to a class of tree-structure networks. In this paper, based on a sufficient condition for controllability, a polynomial-time algorithm is proposed. The proposed...
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this topic has been previously studied, the existing solution may sometimes produce k points that appear in an arbitrarily tiny cluster, and therefore, fail to be representative. Motivated by this, we propose a new definition of...
A restricted Boltzmann machine consists of a layer of visible units and a layer of hidden units with no visible-visible or hidden-hidden connections. The restricted Boltzmann machine is the main component used in building up the deep belief network and has been studied by many researchers. However, the learning algorithm for the restricted Boltzmann machine is a NP-hard problem in general. In this...
In this contribution the global optimal upper bounds of the C-numerical range of an arbitrary square matrix A is investigated. In general the geometry of the C-numerical range is quite complicated and can be yet only partially understood. However, quadratically constrained quadratic programs (QQPs), as an important modelling tool, are used to describe this optimization problem, where the quadratic...
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.