2434 search results - page 149 / 487 » Algorithmic Randomness of Closed Sets |
115
Voted
CEE
2007
15 years 3 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
166
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
145
Voted
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
131
Voted
TPDS
2002
15 years 3 months ago
2002
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
149
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...