3229 search results - page 250 / 646 » The Theory of Timed Automata |
184
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
174
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
182
click to vote
KDD
2006
ACM
16 years 7 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 ...
168
click to vote
AIED
2005
Springer
16 years 6 days ago
2005
Springer
Time on task is an important predictor for how much students learn. However, students must be focused on their learning for the time invested to be productive. Unfortunately, stude...
170
click to vote
HIPC
2005
Springer
16 years 5 days ago
2005
Springer
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...