Search results for "hortes"
showing 10 items of 57 documents
Deep Q-Learning With Q-Matrix Transfer Learning for Novel Fire Evacuation Environment
2021
We focus on the important problem of emergency evacuation, which clearly could benefit from reinforcement learning that has been largely unaddressed. Emergency evacuation is a complex task which is difficult to solve with reinforcement learning, since an emergency situation is highly dynamic, with a lot of changing variables and complex constraints that makes it difficult to train on. In this paper, we propose the first fire evacuation environment to train reinforcement learning agents for evacuation planning. The environment is modelled as a graph capturing the building structure. It consists of realistic features like fire spread, uncertainty and bottlenecks. We have implemented the envir…
Finding k -dissimilar paths with minimum collective length
2018
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set …
Online shortest paths with confidence intervals for routing in a time varying random network
2018
International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
2017
International audience; The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-comple…
Predicting Heuristic Search Performance with PageRank Centrality in Local Optima Networks
2015
Previous studies have used statistical analysis of fitness landscapes such as ruggedness and deceptiveness in order to predict the expected quality of heuristic search methods. Novel approaches for predicting the performance of heuristic search are based on the analysis of local optima networks (LONs). A LON is a compressed stochastic model of a fitness landscape's basin transitions. Recent literature has suggested using various LON network measurements as predictors for local search performance.In this study, we suggest PageRank centrality as a new measure for predicting the performance of heuristic search methods using local search. PageRank centrality is a variant of Eigenvector centrali…
Word assembly through minimal forbidden words
2006
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
The pruning-grafting lattice of binary trees
2008
AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.
Epidemiology of intra-abdominal infection and sepsis in critically ill patients: "AbSeS", a multinational observational cohort study and ESICM Trials…
2019
Pardo-Oviedo, Juan Mauricio/0000-0003-0084-3449; Lopez-Delgado, Juan Carlos/0000-0003-3324-1129; Corradi, Francesco/0000-0002-5588-2608; De Backer, Daniel/0000-0001-9841-5762; POTA, VINCENZO/0000-0001-9999-3388; Tomescu, Dana/0000-0001-9673-5754; Sabetian, Golnar/0000-0001-8764-2150; Girardis, Massimo/0000-0002-2453-0829; Brazzi, Luca/0000-0001-7059-0622; Leone, Marc/0000-0002-3097-758X; Zabolotskikh, Igor Borisovich/0000-0002-3623-2546; De Lange, Dylan/0000-0002-0191-7270; ALMEKHLAFI, GHALEB A./0000-0002-0323-7025; Elke, Gunnar/0000-0002-4948-1605; Grigoras, Ioana/0000-0001-9412-9574; Czuczwar, Miroslaw/0000-0002-9025-6717; Nora, David/0000-0002-1133-7368; Masjedi, Mansoor/0000-0001-6175-9…
The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem
2014
Abstract In many branch-and-price algorithms, the column generation subproblem consists of computing feasible constrained paths. In the capacitated arc-routing problem (CARP), elementarity constraints concerning the edges to be serviced and additional constraints resulting from the branch-and-bound process together impose two types of loop-elimination constraints. To fulfill the former constraints, it is common practice to rely on a relaxation where loops are allowed. In a k-loop elimination approach all loops of length k and smaller are forbidden. Following Bode and Irnich (2012) for solving the CARP, branching on followers and non-followers is the only known approach to guarantee integer …
Epidemiology and patterns of tracheostomy practice in patients with acute respiratory distress syndrome in ICUs across 50 countries
2018
Background: To better understand the epidemiology and patterns of tracheostomy practice for patients with acute respiratory distress syndrome (ARDS), we investigated the current usage of tracheostomy in patients with ARDS recruited into the Large Observational Study to Understand the Global Impact of Severe Acute Respiratory Failure (LUNG-SAFE) study. Methods: This is a secondary analysis of LUNG-SAFE, an international, multicenter, prospective cohort study of patients receiving invasive or noninvasive ventilation in 50 countries spanning 5 continents. The study was carried out over 4 weeks consecutively in the winter of 2014, and 459 ICUs participated. We evaluated the clinical characteris…