4502 search results - page 230 / 901 » Regular Model Checking |
220
Voted
LPNMR
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
220
Voted
AGP
2003
IEEE
16 years 10 days ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
188
Voted
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
195
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Although semi-supervised learning has been an active area of research, its use in deployed applications is still relatively rare because the methods are often difficult to impleme...
165
Voted
GMP
2000
IEEE
15 years 11 months ago
2000
IEEE
A computer graphics object reconstructed from real-world data often contains undesirable noise and small-scale oscillations. An important problem is how to remove the noise and os...