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.
In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of...
In this paper, we present a modified on-demand routing algorithm for mobile ad-hoc networks (MANETs). The proposed algorithm is based on both the standard Ad-hoc On-demand Distance Vector (AODV) protocol and ant colony based optimization. The modified routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the routing overhead, response...
This paper presents an optimizing methodology for implementing a multi-layer perceptron (MLP) neural network in a Field Programmable Gate Array (FPGA) device. In order to obtain an efficient implementation, a compromise of time and area is needed. Starting from simulation in the learning phase with fixed point operators, we have developed a methodology which allows the automatic generation of a VHDL...
In this paper we propose a rough classification modeling algorithm based on Ant Colony Optimization (ACO) reduction. We used ACO to compute the rough set reduct and later a modified rules generation method is employed to generate the classification rules. The rules generation algorithm used is the simplification of the Default Rules Generation Framework (DRGF) in order to fit with the ACO reduct....
The advantages of soft c-means over its hard and fuzzy versions render it more attractive to use in a wide variety of applications. Its main merit lies in its relatively higher convergence speed, which is more obvious in the presence of huge high dimensional data. This work presents a new approach to accelerate the convergence of the original soft c-means. It is mainly based on an iterative optimization...
This paper proposes a new feature-selection strategy by integrating the Rough Set Theory (RST) and Particle Swarm Optimisation (PSO) algorithms to generate a set of discriminatory features for the classification problem. The proposed method is seen as a marriage between filter and wrapper approaches in which the RST is used to pre-reduce the feature set before optimisation by PSO, a meta-heuristic...
Combining pattern recognition is the promising direction in designing an effective classifier systems. There are several approaches of collective decision-making, among them voting methods, where the decision is a combination of individual classifiers' outputs are quite popular. This article focuses on the problem of fuser design which uses continuous outputs of individual classifiers to make a decision...
The necessity of lowering the execution of system tests' cost is a consensual point in the software development community. The present study presents an optimization of the regression tests' activity, by adapting a test cases prioritization technique called Failure Pursuit Sampling-previously used and validated for the prioritization of tests in general-improving its efficiency for the exclusive execution...
Attribute reduction is one of the main issues in the theoretical research of rough set theory which is known as a NP-hard optimization problem. The objective is to find the minimal number of attributes from a large dataset. Hence it is difficult to solve to optimality. This paper proposes a composite neighbourhood structure approach to solve the attribute reduction problem that consists of two versions...
The generalized assignment problem is a well-known NP-complete problem whose objective is to find a minimum cost assignment of a set of jobs to a set of agents by considering the resource constraints. Dynamic instances of the generalized assignment problem can be created by changing the resource consumptions, capacity constraints and costs of jobs. Memory-based approaches are among a set of evolutionary...
In order to improve the classifier performance in semantic image annotation, we propose a novel method which adopts learning vector quantization (LVQ) technique to optimize low level feature data extracted from given image. Some representative vectors are selected with LVQ to train support vector machine (SVM) classifier instead of using all feature data. Performance is compared between the methods...
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.