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.
Dynamic Traveling salesman problem (DTSP) is a theoretical mathematical model and has been widely applied in dynamic problems in reality. Most of the existing methods used to model DTSP lack a realistic foundation, and cannot provide convenient and polytrophic operations to simulate real-world scenarios. In this paper, a reality-based method is proposed to model DTSP. The model features good controllability...
In view of the data sparseness problem existed in the traditional collaborative filtering recommendation algorithm, this paper proposes a hybrid collaborative filtering recommender framework integrated FCM clustering and Slope One algorithm and FSUBCF algorithm. Firstly this algorithm use the Slope One algorithm based on FCM cluster to predict item ratings that users have not rated in matrix, and...
Through program dependence analysis, the method of parallel symbolic execution based on reduction about program execution path family was proposed. Firstly, instruction statements which affect on the symbolic value were extracted according to data dependency. then the key branch conditions controlling these statements were located and connected. Thus the reduction algorithm from multiple paths of...
In this paper a new LMI method is proposed for the strong γk-γcl H∞ stabilization problem. Due to the introduction of a new slack variable, it is expected to be less conservative than the authors' previous work. Furthermore, several recently developed methods can be seen as its special cases. Meanwhile the extended bounded real lemma proposed lately can be adopted to improve the LMI design results...
A novel stereo displaying method is presented in this paper. According to the basic stereovision principle, the relationship between binocular disparity and 3d scene depth is discussed with matrix algebra in detail. With computer graphics considered, the horizontal binocular disparity of spatial point is converted to pixel disparity on screen. Then a spatial range condition of stereovision is introduced...
We start with the background and the solutions of vehicle routing problem, and then focus on the interpretation of Tabu search algorithm and the impact of its key factors. In particular, the idea of tabu search algorithm is applied to solve the vehicle routing problem. We design a new intuitive and easy to understand client-direct-arrangement solution method, and finally realize the algorithm through...
Frequent itemsets mining is a crucial problem in the field of data mining. Although many related studies have been suggested, these algorithms may suffer from high computation cost and spatial complexity in dense database, especially when mining long frequent itemsets or support threshold is very lower. To address this problem, a new data structure called P Array is proposed. P Array makes use 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.