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.
Ant colony optimisation is often used to construct solutions to problems for which it has no a-priori knowledge. However, decision makers and designers often have insight and practical experience concerning what constitutes good and acceptable solutions. In this paper we exploit this knowledge by applying a pre-seeding procedure to the initial pheromone structure. Using the real-world RFID antenna...
Many applications such as pattern recognition require selecting a subset of the input features in order to represent the whole set of features. The aim of feature selection is to remove irrelevant or redundant features while keeping the most informative ones. In this paper, an ant colony system approach for solving feature selection for classification is presented. The proposed algorithm was tested...
Ant colony optimisation has traditionally been used to solve problems that have few/light constraints or no constraints at all. Algorithms to maintain and restore feasibility have been successfully applied to such problems. Set partitioning is a very constrained combinatorial optimisation problem, for which even feasible solutions are difficult to construct. In this paper a binary ant colony optimisation...
Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant colony optimisation, are very efficient at solving problems that require paths to be constructed. This search technique is adapted to solve the grid based path problem for meander line antennas and incorporates the NEC evaluation...
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.