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.
To solve anycast routing problem with multiple QoS constraints, a improved anycast routing algorithm based on simplified particle swarm optimization algorithm and diversity strategy is presented. Firstly, the algorithm simplified the complexity of standard PSO algorithm and improved the convergence velocity extraordinarily by dynamically changing the inertia weight. Then, a mutation operator and diversity...
Designers often need to choose the gate sizes for logic circuit designs to estimate the delay of the circuit. Simulation and timing analysis are poor tools for this task because they cannot be modified for better results. Hence, the method of Logical Effort (LE) provides a simple method to overcome these design problems. We apply a novel Discrete Particle Swarm Optimization algorithm (DPSO) to solve...
In this paper, we proposed a novel probability convergence based particle swarm optimization algorithm for the multiple constrained QoS multicast routing. This algorithm is inspired from the probability convergence attributes. The main contents of this paper includes: (1) A novel particle sorting rule of swarm are designed. (2) A novel probability convergence mechanism is developed in the position...
The difficulty for accurate determination of the angles of arrival (AOA) of signals arises from the optimization of likelihood functions of high dimension. Usually, a gradient-based technique is employed to find the optimum of the function. However, this method requires heavy computational work and the differentiability of the likelihood function. This paper presents two gradient-free methods: One...
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.