4797 search results - page 451 / 960 » The complexity of partition tasks |
202
click to vote
RTSS
2003
IEEE
16 years 4 days ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
173
click to vote
FM
2003
Springer
16 years 2 days ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
191
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
253
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...
195
click to vote
DCOSS
2007
Springer
15 years 10 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...