Results 61 to 70 of about 190,109 (292)
Optimal uncertainty reduction search using the k-shortest path algorithm [PDF]
Proceedings of the 2003 American Control Conference, 2003., 2004 We propose a search algorithm for uninhabited autonomous aerial vehicles (UAAVs) performing a search and surveillance task, based on the uncertainty map of an unknown region. The search algorithm is based on the k-shortest path algorithm that maximizes the effectiveness of the search in terms of searching through the maximum uncertainty region, given a
Sujit, PB, Ghose, D
openaire +2 more sources
Distributed Approximation Algorithms for Weighted Shortest Paths
, 2014 A distributed network is modeled by a graph having $n$ nodes (processors) and diameter $D$. We study the time complexity of approximating {\em weighted} (undirected) shortest paths on distributed networks with a $O(\log n)$ {\em bandwidth restriction} on
Abram J. +3 more
core +1 more source
Vehicle Tracking Using the k-shortest Paths Algorithm and Dual Graphs [PDF]
, 2018 Vehicle trajectory descriptions are required for the development of driving behavior models and in the calibration of several traffic simulation applications.
Azevedo, Carlos Lima +2 more
core +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Системный анализ и прикладная информатика, 2019 Caches are intermediate level between fast CPU and slow main memory. It aims to store copies of frequently used data and to reduce the access time to the main memory.
A. A. Prihozhy
doaj +1 more source
Fine-Grained Complexity Analysis of Two Classic TSP Variants [PDF]
, 2016 We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: given a set of $n$ points in the plane, compute a shortest tour consisting ...
Buchin, Kevin +3 more
core +4 more sources
FEBS Open Bio, EarlyView.Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley +1 more source
Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity
IEEE Access, 2016 Industrial wireless sensor networks (IWSNs) are required to provide highly reliable and real-time transmission. Moreover, for connected K-neighborhood (CKN) sleep scheduling-based duty-cycled IWSNs in which the network lifetime of IWSNs can be prolonged,
Lei Shu +4 more
doaj +1 more source
A sequential algorithm for finding K shortest paths [PDF]
AIP Conference Proceedings, 2018 The readers here we represent an algorithm for sequential optimization of paths in directed graphs relative to different cost functions. The considered algorithm is based on an extension of dynamic programming which allows to represent the initial set of paths and the set of optimal paths after each application of optimization procedure in the form of ...
Sevdalin Tsvetanov, Daniela Marinova
openaire +1 more source
Path-Fault-Tolerant Approximate Shortest-Path Trees
, 2015 Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{sparse} set of \emph{auxiliary} edges selected from $E$, in order to ...
A. D’Andrea +12 more
core +1 more source