Sciweavers

1115 search results - page 193 / 223
» An Abstract Look at Realizability
Sort
View
AH
2008
Springer
14 years 3 months ago
Analysing High-Level Help-Seeking Behaviour in ITSs
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...
Moffat Mathews, Tanja Mitrovic, David Thomson
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 3 months ago
Fixed-Period Packet Sampling and its Application to Flow Rate Estimation
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...
Sadayoshi Ito, Kousuke Uchiyama, Shigeo Shioda
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 2 months ago
Worst-Case to Average-Case Reductions Revisited
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...
Dan Gutfreund, Amnon Ta-Shma
CIE
2007
Springer
14 years 2 months ago
Computational Complexity of Constraint Satisfaction
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...
Heribert Vollmer
CP
2007
Springer
14 years 2 months ago
Tradeoffs in the Complexity of Backdoor Detection
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...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...