3946 search results - page 67 / 790 » The computational complexity of choice sets |
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
ACSAC
2004
IEEE
15 years 3 months ago
2004
IEEE
modeling, such as using epidemic models, has been the general method of choice for understanding and analyzing the high-level effects of worms. However, high-fidelity models, such...
GRC
2005
IEEE
15 years 5 months ago
2005
IEEE
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
104
click to vote
COLT
1993
Springer
15 years 3 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
ICMLA
2008
15 years 1 months ago
2008
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...