Results 41 to 50 of about 1,848,326 (324)
MODELING OF EMERGENCY EVACUATION IN BUILDING FIRE [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 One of the main problems of rescue workers in confrontation of fired complex buildings is the lack of sufficient information about the building indoor environment and their emergency exit ways.
H. Bayat +5 more
doaj +1 more source
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths [PDF]
Symposium on the Theory of Computing, 2015 We present a deterministic (1+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here n is the number of nodes in the network and D is its ...
Monika Henzinger +2 more
semanticscholar +1 more source
Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Paths [PDF]
Conference on Empirical Methods in Natural Language Processing, 2015 Relation classification is an important research arena in the field of natural language processing (NLP). In this paper, we present SDP-LSTM, a novel neural network to classify the relation of two entities in a sentence. Our neural architecture leverages
Yan Xu +5 more
semanticscholar +1 more source
Percolating paths through random points : [PDF]
, 2005 We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process.
Aldous, David, Krikun, Maxim
core +4 more sources
MULTI-CRITERIA PATH FINDING [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Path finding solutions are becoming a major part of many GIS applications including location based services and web-based GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel
E. Mohammadi, A. Hunter
doaj +1 more source
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
Approximate Euclidean shortest paths in polygonal domains [PDF]
, 2019 Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input parameter ...
Inkulu, R, Kapoor, Sanjiv
core +2 more sources
Should QoS routing algorithms prefer shortest paths? [PDF]
, 2003 Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay ...
Collier, Martin, Kowalik, Karol
core +2 more sources
Finding $k$ Simple Shortest Paths and Cycles [PDF]
, 2016 The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair,
Agarwal, Udit, Ramachandran, Vijaya
core +2 more sources
Shortest Paths and Distances with Differential Privacy [PDF]
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2015 We introduce a model for differentially private analysis of weighted graphs in which the graph topology (υ,ε) is assumed to be public and the private information consists only of the edge weights ω : ε → R+. This can express hiding congestion patterns in
Adam Sealfon
semanticscholar +1 more source