Results 141 to 150 of about 166,383,871 (189)

Learning to Route with Sparse Trajectory Sets

2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018
Motivated by the increasing availability of vehicle trajectory data, we propose learn-To-route, a comprehensive trajectory-based routing solution. Specifically, we first construct a graph-like structure from trajectories as the routing infrastructure. Second, we enable trajectory-based routing given an arbitrary (source, destination) pair. In the first
Chenjuan Guo   +3 more
openaire   +3 more sources

Simplex-Like Trajectories on Quasi-Polyhedral Sets

Mathematics of Operations Research, 2001
This paper presents a unified treatment of two new simplex-like methods for linear semi-infinite programming problems with quasi-polyhedral feasible sets. The simplex method combines a purification phase I (which provides an extreme point from a given feasible solution) with the iterative application of a pivot operation, yielding a trajectory which ...
Edward J. Anderson   +2 more
openaire   +3 more sources

RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS

International Journal of Foundations of Computer Science, 2005
The decidability of the shuffle decomposition problem for regular languages is a long standing open question. We consider decompositions of regular languages with respect to shuffle along a regular set of trajectories and obtain positive decidability results for restricted classes of trajectories.
Michael Domaratzki, Kai Salomaa
openaire   +4 more sources

Behavior of Trajectories in Localizing Sets

Doklady Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Localizing sets and trajectory behavior

Doklady Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kanatnikov, A. N., Krishchenko, A. P.
openaire   +1 more source

Home - About - Disclaimer - Privacy