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.
The paper addresses the optimal design of the last branch of the pharmaceutical supply chain, i.e., the hospital drug distribution chain (HDDC), starting from suppliers till the patients of a department. Considering a distributed healthcare system composed of different stages connected by medicine and information links labeled with suitable performance indices, a procedure employing digraph modeling...
The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle free tunnel through which to plan a dynamically feasible path. This work investigates two aspects of the algorithm. First, a greedy cut method is proposed for improved decomposition of the environment, resulting in fewer regions...
Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow distribution...
The paper addresses the identification problem of discrete event systems by determining the structure and the initial marking of a Petri net (PN) modeling the system. More precisely, we assume that the numbers of places and of transitions are given and that a finite sequence of transitions and the corresponding markings are completely or partially known. Hence, the conditions to univocally identify...
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.