1115 search results - page 193 / 223 » An Abstract Look at Realizability |
114
Voted
AH
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper, we look at initial results of data mining students’ help-seeking behaviour in two ITSs: SQL-Tutor and EER-Tutor. We categorised help given by these tutor...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— We propose a packet sampling strategy called fixedperiod sampling, which selects at most one packet in every fixedlength period. Under the fixed-period sampling, the...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
103
Voted
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
CP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...