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.
Turbo equalization schemes based on minimum mean square error (MMSE) criteria available in the literature for multiple-input multiple-output (MIMO) systems are computationally expensive, as they require a relatively large matrix inversion. In this paper, we propose a low complexity turbo equalization (TE) scheme with successive interference cancellation for orthogonal frequency division multiplexing...
Replanning is a powerful tool for high dimensional mobile agents in changing environments. However, most works employ replanning periodically. In order to fully exert the merits of this powerful tool, we should concentrate on the time interval employed for each replanning (that is “when to replan”) and carry out replanning adaptively. In this paper, an adaptive strategy is proposed to govern replanning...
Although lots of planning algorithms have focused on the planning of fixed manipulators and mobile robots in moderate dynamic environments, seldom planning algorithms can be employed to deal with mobile agents in the presence of large scenario scales and unpredictable changing obstacles. Path planning for mobile robots in unpredictable environments would be an extreme challenge since computational...
Path planning for mobile robots with high degree of freedom (DOF) is an extreme challenge. Although lots of algorithms have focused on the planning of fixed manipulators and mobile robots with low degree of freedom, seldom of them can be employed to deal with high DOF mobile agents. The unpredictable obstacles and too many freedoms increased computational complexity dramatically. In this paper, a...
The concept of elementary (flux) modes provides a rigorous description of pathways in metabolic networks. Finding the elementary modes with minimum number of reactions (shortest elementary modes) is an interesting problem and has potential uses in various applications. However, this problem is NP-hard. This work is an initial step to analyze this problem from a parameterized computation view. With...
Inverse Scope Problem aims to determine, by analyzing the structure of a metabolic network, the minimum cardinality set of seed compounds required for the synthesis of a specific compound or set of compounds. This paper examines the computational complexity of three variants of the inverse scope problem from parameterized complexity view. With as natural parameter the minimum number of metabolites...
In this paper, we consider the following scheduling model: jobs can either be scheduled on an unbounded parallel batch processor or be rejected. Jobs arrive at different times. The scheduled jobs will be processed together as a batch the processing time of which is the greatest processing time of its members. For each rejected job, there is a corresponding penalty cost. The objective is to minimize...
This paper reports a pruning scheme specifically for morphological skeletons. We polished the boundary/axis ratio significance measure by H. Blum and R. N. Nagel to a contour length significance measure, CLSM. We analyzed its advantages compared to two recently proposed pruning approaches, and designed an adequate algorithm for it, based on a firm mathematical MAT theory by H. I. Choi et al. After...
Robotic path planning in changing environments with difficult regions is an extremely challenge. Since the structure of configuration space (C-space) will change when obstacles move in workspace (W-space), the planner should have the capacity of building approximate structure of C-space, while avoiding intense computational complexity. Further, difficult regions will also change their positions, which...
Component-based product design usually appears as a multi-objective optimization problem (MOP). Traditional methods solving MOPs are robust and have proven their effectiveness in handling many classes of optimization problems. However, such techniques can encounter difficulties such as getting trapped in local minima, increasing computational complexity, and not being applicable to certain classes...
This paper proves that deploying sensors on grid points to construct a wireless sensor network that fully covers critical grids using minimum sensors (critical-grid coverage problem) and that fully covers a maximum total weight of grids using a given number of sensors (weighted-grid coverage problem) are each NP-complete
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.