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.
The problem of identifying discrete time affine hybrid systems with noisy measurements is addressed in this paper. Given a finite number of measurements of input/output and a bound on the measurement noise, the objective is to identify a switching sequence and a set of affine models that are compatible with the a priori information, while minimizing the number of affine models. While this problem...
A variant of competitive differential evolution modified for the solution of single objective constrained realparameter optimization is presented in this paper. The modification consists in alternation of minimization of the constrains' violation and minimization of objective function value. The variant was tested on the family of 18 problems developed for the Special Session S000 of CEC2010. Using...
This work suggests an adaptive tour route planning multimedia system designed to meet the needs of different tourists. Tour route planning is a `traveling salesman problem' (TSP) type problem. TSP is an example of a combinatorial optimization problem and is known as NP-hard. As studied by many researchers exact, heuristic (approximation) and meta-heuristic algorithms are usually applied for NP problems...
A recent work [1] proposed a novel group sparse classifier (GSC) that was based on the assumption that the training samples of a particular class approximately form a linear basis for any test sample belonging to that class. The group sparse classifier requires solving an NP hard group-sparsity promoting optimization problem. Thus a convex relaxation of the optimization problem was proposed. The convex...
The problem of affine rank minimization seeks to find the minimum rank matrix that satisfies a set of linear equality constraints. Generally, since affine rank minimization is NP-hard, a popular heuristic method is to minimize the nuclear norm that is a sum of singular values of the matrix variable. A recent intriguing paper shows that if the linear transform that defines the set of equality constraints...
Using CDMA technology, one has to contend with interference in frequency-selective channels caused by multipath propagation and fading. Transmitter-based methods such as zero forcing joint transmission and transmit Wiener filter only reduce the bit error rate indirectly and do not exploit the knowledge of the transmit data symbols. Nonlinear optimization strategies, e.g., the Constrained Minimum BER...
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions.The new problems include submodular load balancing, which generalizes load balancing or minimum-makespan scheduling, submodular sparsest cut and submodular balanced cut, which generalize their respective graph cut problems, as well as submodular...
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.