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.
Palmprint identification is a subcategory of biometrics identification, which can be efficiently used to identify the people. Palmprint-based identification is currently a potential alternative to human identification method of a well known fingerprint-based identification. For example, if the hand of the identified person is dirty, the accuracy of fingerprint-based identification is distorted, while...
Optimization problems are ubiquitous and consequential. In fact every sphere of human activity that can be quantified can be formulated as an optimization problem. The focus of this work is on Global Optimization which is not only desirable but also necessary in many cases. In the past few decades several Global optimization algorithms have been suggested in literature out of which stochastic, population...
In this paper we propose an approach for test data generation using genetic algorithm. Our objective is to design a multi-population genetic algorithm using uniform crossover. In this paper we analyze the performance of proposed uniform crossover multi population genetic algorithm method with different combinations of factors that influence the test data generation strategy. For implementing multi-population...
In this paper we have used a real coded genetic algorithm for finding the global minimum energy conformation of two small molecules viz. Pseudoethane and 1,2,3-trichloro-l-fluoro-propane based on a potential function. Finding the global minimum of this function is very difficult because it has a large number of local minima, which grows exponentially with molecule size. Computational results are obtained...
Genetic programming is now a common research tool in financial applications. One classic line of exploration is their use to find effective trading rules for individual stocks or for groups of stocks (such as an index). The classic work in this area (Allen & Karjaleinen, 99) found profitable rules, but which did not outperform a straightforward ??buy and hold?? strategy. Several later works report...
This paper presents hardware architecture and FPGA implementation of a parallel genetic algorithm called elitism-based compact genetic algorithm (EC-CGA). EC-CGA uses the probability model migration instead of migrating individuals in the population. The performance of the EC-CGA is enhanced by elitism-based approach. We propose scalable hardware architecture for the EC-CGA. The highly parallelized...
In recent past a number of researchers have proposed strategies for finding test order during Integration testing of object oriented applications while minimizing the cost of stub creation. Some researchers have used graph-based approach while others have suggested solutions using genetic algorithms. This paper presents a survey of various graph-based strategies and genetic algorithm based strategies...
In order to solve problems of semantics recognition and information extraction in the process of service composition, we proposed a Petri Net model of semantics service composition based on Ontology. Firstly, which build a described approach of semantics service composition ontology-oriented, and exploits property of WSMO to describe; Secondly,build Petri Net model of semantics service composition,...
The university course timetabling problem is a combinatorial optimization problem concerning the scheduling of a number of subjects into a finite number of timeslots in order to satisfy a set of specified constraints. The timetable problem can be very hard to solve, especially when attempting to find a near-optimal solutions, with a large number of instances. This paper presents a combination of particle...
In this paper, first raised the possibility of such a tendency on services framework - a degree of dependence. The framework and support-confidence framework completely different. D database is the tendency of the incident and the extent of the incidents linked to the degree of measure contains rules. Comparatively speaking, more direct causal relationship between the events described, a more effective...
In order to evaluating performance of listed companies comprehensively, this paper analyzes multi-index based on projection pursuit, and optimize the weight of financial indicators by Using RAGA (real coding based on accelerating genetic algorithm). This method succeeded in dynamic weighing, makes full use of data, obtains more reasonable and scientific comprehensive performance evaluation.
This paper introduces triangulation theory into genetic algorithm and with which, the optimization problem will be translated into a fixed point problem. An improved genetic algorithm is proposed by virtue of the concept of relative coordinates genetic coding, designs corresponding crossover and mutation operator. Through genetic algorithms to overcome the triangulation of the shortcomings of human...
This paper introduces triangulation theory into genetic algorithm and with which, the optimization problem will be translated into a fixed point problem. An improved genetic algorithm is proposed by virtue of the concept of relative coordinates genetic coding, designs corresponding crossover and mutation operator. Through genetic algorithms to overcome the triangulation of the shortcomings of human...
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.