1381 search results - page 104 / 277 » Computational Complexity of Constraint Satisfaction |
130
click to vote
CP
1999
Springer
15 years 8 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
147
click to vote
FROCOS
2000
Springer
15 years 8 months ago
2000
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
146
click to vote
KR
2000
Springer
15 years 7 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
146
click to vote
COR
2011
14 years 11 months ago
2011
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
109
click to vote
STACS
2005
Springer
15 years 9 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...