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.
This paper presents algorithm for optimal reconfiguration of distribution networks using hybrid heuristic genetic algorithm. Improvements introduced in this approach make it suitable for real-life networks with realistic degree of complexity and network size. The algorithm introduces several improvements related to the generation of initial set of possible solutions as well as crossover and mutation...
A self-organized system emerges as the result of interactions between its components. Such interactions are not organized centrally but in a distributed manner. In this paper, a new neighborhood restructuring is proposed in socially motivated algorithms based on the concept of self-organization. We propose an algorithm where the individuals increase/decrease their neighborhood size to emerge an irregular...
We propose a new population-based optimization algorithm, named Social Network-based Swarm Optimization algorithm (SNSO), for solving unconstrained single-objective optimization problems. In SNSO, the population topology, neighborhood structure and individual learning behavior are used to improve the search performance of a swarm. Specifically, a social network model is introduced to adjust the population...
We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in its neighborhood. We introduce a topological property known as r-robustness of a graph, and show that this property provides improved bounds on tolerating malicious...
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.