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 software project management, software effort estimation is an important task. Software effort estimation will be helpful for finding the estimation of cost, duration of the project. In the recent time, many types of model are coming but among all, COCOMO model is widely used model. In past lots of Research have been done for correct and Accurate Effort Estimation. Many Algorithm has been applying...
Genetic algorithms (GA) imitates the nature's method of evolution. In the process of evolution chromosomes crossover and mutate to generate new offspring's. This toolbox imitates GA and provides Graphical User Interface (GUI) to understand GA and provides way to input parameters that can be defined precisely by user to experiment the GA. It can also be integrated with any problem where GA can be used...
Genetic Algorithm (GA) is one of most popular swarm based evolutionary search algorithm that involves multiple data independent computations. Such computations can be made parallel on GPU cores using Compute Unified Design Architecture (CUDA) platform. In this paper, various operations of GA such as fitness evaluation, selection, crossover and mutation, etc. Are implemented in parallel on GPU cores...
The decision of selecting the right product from market is getting tedious these days from customers point of view, as firms offering product at low cost do not provide the assurance that the product will work as desired by the consumer whereas companies providing good quality products sell their product at relatively high prices. As a customer, a person looks around for a product which is low in...
The study investigates optimal policies for determining price of the product under the influence of reworking during production. A mathematical model is proposed using optimal control theory for profit maximization, which determines the optimal pricing strategies. Moreover, we have considered reworking of imperfect items being produced during the machine shifts from in-control state to out-control...
This paper brings out the studies of generation scheduling problem in an electrical power system. This paper presents some general reviews of research and developments in the field of unit commitment based on published articles and web-sites. Here, it is set about to perform a comprehensive survey of research work made in the domain of Unit Commitment using various techniques. This may be a helpful...
In the present study, optimization of immobilized lipase mediated solvent-free synthesis of octyl acetate by transesterification has been carried out based on the experimentally validated RSM model. The effect of tansesterification variables namely alcohol molarity, reaction time, temperature, Immobilized lipase amount on molar conversion (%) was investigated. A maximum molar conversion of 92.92%...
Distributed query processing has become essential in today's scenario to address the changing business needs of users. It aims to arrive at an optimal query processing plan for a given distributed query. This is a complex process as the number of possible query processing plans grows rapidly with increase in the number of sites used, and relations accessed, by the query. Therefore, there is a need...
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.