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.
The Support Vector Machines (SVM) become popular E-Business data mining tools recently, and the datasets of E-Business are usually large-scale. If Support Vector Machines are trained on large-scale datasets, the training time will be very long and the classifier's accuracy will become lower too. As training a large-scale SVM is equated to solve a large-scale quadratic programming (QP) problem, so...
In this paper, we consider optimization of polynomials in a parallel computing environment. Algorithms for optimization of polynomials can be used to solve NP-hard control problems such as stability of nonlinear and delayed systems. Unfortunately, the high computational costs of current algorithms such as sum-of-squares has limited its use to relatively small problems. In this paper we review several...
A novel parallel predictor-corrector interior-point algorithm (P-PCIPA) is proposed. The algorithm uses technique of predictor-corrector to improve the centrality of the iterate point to reduce the number of iterations. Corrector equation, which has special structure, of our parallel algorithm for a class of large scale optimization problems has been presented. And this structured corrector equation...
Performance of an algorithm mainly depends on both computer architecture and software. An Intel Xeon processor based HPC cluster and Intel Itanium2 based symmetric multiprocessing (SMP) architectures are used for performance analysis of PDE based parallel algorithm. Algorithm is parallelized using MPI and performance measurements are done using Tuning and Analysis Utilities (TAU). Computational optimization...
Ant colony algorithm is an efficient intelligent algorithm to solve NP hard problem. This paper presents a parallel computing solution based on General Purpose GPU (GPGPU) to solve traveling salesman problem (TSP) with max-min ant system (MMAS). The experimental result shows it is more efficient than pure CPU computing.
In this paper, we present a variational framework for joint disparity and motion estimation in a sequence of stereo images. The problem involves the estimation of four dense fields: two motion fields and two disparity fields. In order to reduce computational complexity and improve estimation accuracy, the two motion fields, for the left and right sequences, and the disparity field of the current stereo...
Keeping balance between the diversity of population and the convergence of evolution for genetic algorithm remains a work of art. It is well known that the chaotic mapping helps to maintain good diversity for population and Baldwin effect based posterior learning promotes evolution along the right direction, thus forming chaotic parallel genetic algorithm with Baldwin learning (CPGABL). In this paper,...
Ubiquitous and pervasive computing systems are characterized by intelligent sensing and computing. These systems seamlessly understand and respond to the environment with little human intervention. Since such systems are required to be small and inobtrusive, embedded systems play an important role in their design. Furthermore, these systems need to run sophisticated applications in a resource constrained...
A parallel algorithm of simulated annealing to solve the vehicle routing problem with time windows (VRPTW) is considered. The VRPTW is an NP-hard bicriterion optimization problem in which both the number of vehicles and the total distance traveled by vehicles are minimized. The objective is to establish to what extent the computation time required to solve the VRPTW can be decreased by a number of...
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.