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.
This paper focus on the admissible consensus problem for a class of singular discrete-time multi-agent systems. Based on graph, algebra and singular system theory, the consensus protocol of static output feedback form is proposed and designed. Sufficient and necessary conditions are obtained to solve the consensus problem for singular discrete-time multi-agent systems. The conditions depend on the...
This paper investigates the consensus problem for a class of heterogeneous singular multi-agent systems. Based on graph, algebra and singular system theory, sufficient and necessary conditions are obtained. The conditions depend on the topologies of heterogeneous singular multi-agent systems and the structure properties of each agent dynamics. Moreover, the distributed consensus protocol is designed...
In order to deal with the problem of access network selection in the next generation wireless networks, it is necessary to develop an adequate model for its selection. This paper presents the proposal of optimal network selection algorithm in wireless heterogeneous environment that is based on reputation model. It not only considers the users' preferences, but also the results of network admission...
RCP algorithm is a rate-based explicit congestion control, it performs well on the efficiency convergence and fairness convergence and has a good performance under the multiple-bottleneck network topology environment. But some researches show that, when a new flow join in the network RCP algorithm exists severe instantaneous over loading, this phenomenon results in the packet loss. We added source...
LPI is not efficient in time and memory which makes it difficult to be applied to very large data set. We propose a optimal algorithm called FLPI. FLPI decomposes the LPI problem as a graph embedding problem plus a regularized least squares problem. Such modification avoids eigen decomposition of dense matrices and can significantly reduce both time and memory cost in computation. Moreover, with a...
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.