1568 search results - page 142 / 314 » The problem of examination questions in algorithmics |
130
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
125
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
141
click to vote
CAV
2001
Springer
15 years 9 months ago
2001
Springer
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
192
click to vote
GOSLER
1995
15 years 8 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
138
click to vote
ECWEB
2007
Springer
15 years 10 months ago
2007
Springer
The open nature of collaborative recommender systems present a security problem. Attackers that cannot be readily distinguished from ordinary users may inject biased profiles, deg...