Results 261 to 270 of about 1,007,743 (297)
Some of the next articles are maybe not open access.
Applied Mathematics and Computation, 2001
The following theorem is proved by using a continuation method: Consider an autonomous differential equation system \[ x'(t)= f(x(t)),\quad x(t_0)= x_0,\tag{1} \] where \(f: \mathbb{R}^n\to \mathbb{R}^n\) satisfies 1. \(f\in C^1(\mathbb{R}^n)\); 2. There is a constant \(k\) such that \(\| f(x)\|< k\) when \(x(\cdot)\) is a solution to problem (1); 3 ...
openaire +2 more sources
The following theorem is proved by using a continuation method: Consider an autonomous differential equation system \[ x'(t)= f(x(t)),\quad x(t_0)= x_0,\tag{1} \] where \(f: \mathbb{R}^n\to \mathbb{R}^n\) satisfies 1. \(f\in C^1(\mathbb{R}^n)\); 2. There is a constant \(k\) such that \(\| f(x)\|< k\) when \(x(\cdot)\) is a solution to problem (1); 3 ...
openaire +2 more sources
Fundam. Informaticae, 2006
Summary: We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered trajectory-based operations can all be expressed in this formalism. It is shown that the generalized operations can simulate Turing machine computations.
Michael Domaratzki +2 more
openaire +2 more sources
Summary: We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered trajectory-based operations can all be expressed in this formalism. It is shown that the generalized operations can simulate Turing machine computations.
Michael Domaratzki +2 more
openaire +2 more sources
A Survey on Trajectory Data Management, Analytics, and Learning
ACM Computing Surveys, 2022Shane Culpepper, Gao Cong, Sheng Wang
exaly
2012 20th Signal Processing and Communications Applications Conference (SIU), 2012
Mehmet Fatih Amasyali +2 more
openaire +1 more source
Mehmet Fatih Amasyali +2 more
openaire +1 more source