1941 search results - page 37 / 389 » On the Hardness of Approximate Reasoning |
ECSQARU
2005
Springer
15 years 5 months ago
2005
Springer
109
click to vote
DELTA
2004
IEEE
15 years 3 months ago
2004
IEEE
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
SOFSEM
2004
Springer
15 years 5 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...