available in market now a days. In addition artificial neural network (ANN) model was developed and optimal solution for producing maximum efficiency was obtained using C++ algorithm. Our C++ program
some potential solutions. These individuals evolve in order to generate better solution until some optimization criterion is met. Here the goal of this work is to find the trajectory which ... Jupiter), spending minimal…
Problem (FSP) is one of the most popular scheduling models existing in practice, which is among the hardest combinatorial optimization problems . Particle Swarm Optimization (PSO) is a population based metaheuristic
second objective is the minimization of the stopping time. The disc brake optimization model has four design variables and five inequality constraints. To improve the performance of NSGA ... main objective of this…
fixed to k, k-means clustering gives a formal definition as an optimization problem. The clustering model most closely related to statistics is based on distribution model. Experiments attempts ... algorithm categorizes…
algorithm in identifying the optimal path along with its navigation controlling mechanism of a mobile robot agent navigational systems. The mobile robot agents are modelled to work independently through
elaborated from the preference-aware relational data model and the queries with the preferences are processed using an extended algebra. Query optimization strategies are provided for extended query plan based
unexpected problem or error. In this project work, we propose a model to analyze an optimal fault tolerant strategy to improve the resilience of cloud applications. The cloud applications
vehicle.Internet access in vehicles is achieved with the support of VANET communication models. Downloading optimization scheme is used to improve the content downloading throughput. Roadside infrastructure, vehicleto-…
online storage clouds, where data are stored based on the pay-as-you-go model. There are many cost-effective approaches have been developed for achieving minimum cost benchmark. However ... paper, for incorporating data…
provide the cooperative cache facility. Data request and data reply are overheard to optimize cache placement and cache discovery. Cache placement mechanism is used to assign data under cache nodes ... with node…
High dimensional data values are processed and optimized with feature selection process. A feature selection algorithm is constructed with the consideration of efficiency and effectiveness factors. The efficiency…
overhearing data from intermediate nodes. Data request and data reply are overheard to optimize cache placement and cache discovery. Cache placement mechanism is used to assign data under cache nodes ... with node…
Object, attribute and context information are linked in the dimensional data models. Cluster quality is decided with domain knowledge and parameter setting requirements. CAT Seeker is a centroidbased actionable…
iron losses and optimizes the efficiency of a induction motor drives. This method is based on a simple induction motor indirect field oriented control model includes various losses uses only
Here different type of strategies can be used. Previously they have used ANT colony optimization and Game theory method. Here job arrival pattern is not predictable. In this method ... also not efficient. Load balancing…
cloud profit given some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimal pricing of query services. The model should be plausible in that it reflects ... involved in the…
scheduling algorithm is improved for dynamic wireless network by changing scheduling scheme with adaptation model. Our end-to-end delay and throughput bounds are in simple and closed forms ... linearly with the number…
privacy models is integrated with data scheduling mechanism. Privacy preservation is ensured with dynamic data size and access frequency values. Storage space and computational requirements are optimally utilized
performance limits of such a vehicular content downloading system by modelling the downloading process as an optimization problem, and maximizing the overall system throughput. Our approach allows us to investigate
clustering is one type of clustering model that solves many normal clustering problems. The both novel subspace clustering algorithms known as fixed and optimal centroids are allows getting more profitable
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.