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 work is concerned with the implementation of an Adaptive Fault Diagnoser (AFD) for a system modeled by Timed Continuous Petri Nets under infinite server semantics, where the set of potential faults is a priori known, however their presence during system evolution, type, location, occurrence time, magnitude and behavior over time are unknown. There exist previous works reported in literature,...
In this paper we propose the combination of accelerated variants of value iteration with improved prioritized sweeping for the solution of stochastic shortest path Markov decision processes. For the fastest solution, asynchronous updates, prioritization and prioritized sweeping have been tested. A topological reordering algorithm was also compared with a static reordering algorithm. Experimental results...
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow to obtain a hierarchy of clusterings. The algorithm is based on some mathematical properties, which are introduced in the paper. The experimental results over the AFP and TDT2 news collections show the usefulness of our method...
This paper considers the problem of generating a set of efficient (non-dominated) schedules on identical parallel machines involving total flow-time and total number of tardy jobs. In view of the NP-hard nature of this problem, heuristic algorithms are proposed for its solution. Two evaluation methods that provide a scheme by which multiple non-dominated sets can be compared are described and used...
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.