215 search results - page 6 / 43 » Computing Branches Out: On Revitalizing Computing Education |
SIGCSE
1995
ACM
13 years 11 months ago
1995
ACM
Students get more out of an interactive lecture than a passive lecture because they are given time to think. This time allows them to determine if they understand a concept, and i...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
IEEEPACT
2002
IEEE
14 years 18 days ago
2002
IEEE
Researchers have studied hybrid branch predictors that leverage the strengths of multiple stand-alone predictors. The common theme among the proposed techniques is a selection mec...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...