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.
Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and...
A central problem in Web services domain is how to get optimal composition of Web services in an uncertain environment. Thousands of Web services published in the internet every day, a large portion of these services may become invalid, deleted or modified. Presently, the environment of Web services changes frequently. In this uncertain service environment, our main object is to find a way to get...
Aimed at target tracking in the video image sequences, this paper introduces a dynamic objects tracking algorithm based on the combination of Kalman prediction and covariance module updating. Via kalman prediction, the getting of the dynamic interesting regions in the next frame of the image sequences, an operation which facilitates the realization of the real-time target localization, can be realized...
It is paid more attention to seismic collapse of high-rise RC frame structures in recent years. In this paper, seismic collapse process of a ten-storey RC frame structures from elastic stage to crack, then to collapse is simulated and analyzed using the finite element software named ANSYS/LS-DYNA. The simulation result is in good accordance with the actual seismic collapse process. It proves that...
This paper presents a particle swarm optimization for solving Steiner tree problem. In the algorithm a tree structure representation is used to encode a particle. To realize the transmission of tree structure information a novel method of particles flying in search space is proposed. We also present the r-neighborhood ring topology of particles to enhance the ability of local and global search of...
Based on Chaotic Genetic Algorithm idea, this paper presents a new solution for the classic Knapsack Problem(KP). We introduce Chaos idea into Genetic Algorithm, adding the disturbance to help finding better solutions in the traditional Genetic Algorithm. Results of numerical tests show that it has high efficiency and the good ability of global optimization.
An important problem in autonomous mobile robot (Mobot) navigation is that the mobot can effectively plan a path in the unknown or partial unknown environment. It’s unpractical to know the environment completely. These factors, such as bias of environmental expression and change of obstacles state, will cause incomplete information of environment. In this case, the motion planning must be implemented...
This paper presents an artificial fish swarm algorithm for solving Steiner tree problem. A novel encoding method of avoiding the loop generation for artificial fish representation of tree-structure and the operator of behaviors of artificial fish for searching optimal solution of Steiner tree problem are proposed. Simulation experiments have been carried out on different network topologies for networks...
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.