Sciweavers

606 search results - page 19 / 122
» Discrete Time Process Algebra
Sort
View
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
14 years 8 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
COMPGEOM
2007
ACM
13 years 11 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
FORTE
2004
13 years 9 months ago
How Synchronisation Strategy Approximation in PEPA Implementations Affects Passage Time Performance Results
Passage time densities are useful performance measurements in stochastic systems. With them the modeller can extract probabilistic quality-of-service guarantees such as: the proba...
Jeremy T. Bradley, Stephen T. Gilmore, Nigel Thoma...
FORMATS
2006
Springer
13 years 11 months ago
Integrating Discrete- and Continuous-Time Metric Temporal Logics Through Sampling
Abstract. Real-time systems usually encompass parts that are best described by a continuous-time model, such as physical processes under control, together with other components tha...
Carlo A. Furia, Matteo Rossi
DEDS
2010
157views more  DEDS 2010»
13 years 4 months ago
On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
Jianfeng Mao, Christos G. Cassandras