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.
Software maintenance has been recognized by academicians and practitioners from industry as the most challenging and expensive part in software life cycle. The complexity and high costs of maintenance activities require systematic evidence of all maintenance activities and accurate models for planning and managing them. A common way for analyzing practice in software engineering is based on trend...
Knowledge is recognized as an essential factor in successful and competitive software organizations. Software organizations acquire, create, systematize and use knowledge in their everyday activities. One of the most efficient ways for discovering, creating and systematizing knowledge is implementation of software process assessment activities. Assessment activities allow investigation of current...
The present work extends the already established prolific geodesic active field methodology of Riemannian type, which generalizes the Casseles‐Kimmel‐Sapiro weighted length problem, and a direction dependent Finslerian structure is proposed as alternative for the GAF image registration process. The proposed extension relies on the direction‐dependent 0‐homogeneous associated weight metric tensor and...
This paper presents project duration assessment model based on modification of shortest path algorithms and superposition. One of the shortest path algorithms, Dijkstra algorithm, is modified in order to find the longest path. This is used for critical path calculation, i.e. for resolving project duration assessment problem. Another modification of algorithm calculates sub critical path as the second...
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.