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.
To solve the vertex cover problem in an agent-based and distributed networking systems utilizing local information, we treat each vertex as an intelligent rational agent rather than an inanimate one and provide a spatial-snowdrift-game-based optimization framework to vertex cover of networks. We analyze the inherent relation between the snowdrift game and the vertex cover: Strict Nash equilibriums...
This paper is concerned with a collinear scaling algorithm based on adaptive trust region for unconstrained optimization. Under certain mild conditions, we establish the global convergence result of the proposed method. We can accomplish our algorithm with the simpler symmetric-rank-1 qusi-Newton updating formula. Numerical results show that the new method is efficient.
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.