2446 search results - page 84 / 490 » Choiceless Polynomial Time |
ICCV
2009
IEEE
15 years 21 days ago
2009
IEEE
We use concepts from chaos theory in order to model
nonlinear dynamical systems that exhibit deterministic behavior.
Observed time series from such a system can be embedded
into...
FM
2001
Springer
14 years 6 days ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
RTSS
2007
IEEE
14 years 2 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
CSCLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...