3229 search results - page 321 / 646 » The Theory of Timed Automata |
179
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
189
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
249
click to vote
ASC
2011
15 years 1 months ago
2011
In the area of data mining, the discovery of valuable changes and connections (e.g., causality) from multiple data sets has been recognized as an important issue. This issue essen...
193
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
174
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...