2725 search results - page 371 / 545 » Constraint Solving for Interpolation |
156
click to vote
RTCSA
2005
IEEE
15 years 10 months ago
2005
IEEE
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
117
click to vote
AIED
2005
Springer
15 years 10 months ago
2005
Springer
: Several studies have shown that explaining actions increases students’ knowledge. In this paper, we discuss how NORMIT supports self-explanation. NORMIT is a constraint-based t...
147
click to vote
CCS
2005
ACM
15 years 10 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
134
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
138
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...