796 search results - page 119 / 160 » Constructivism in computer science education |
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
161
click to vote
CHI
2009
ACM
16 years 6 months ago
2009
ACM
Senior citizens often find it difficult to remember names. This paper describes a novel cell phone application that uses information about one's social network and the places...
131
Voted
CHI
2009
ACM
16 years 6 months ago
2009
ACM
We outline strategies for actuated tangible user interfaces (TUIs) to improve the study of proteins. Current protein study tools miss fundamental biology concepts because graphica...
168
Voted
SIGCSE
2002
ACM
15 years 5 months ago
2002
ACM
This paper reports on the implication of different preferred learning styles on students'performance in the introductory programming sequence and on work in progress on how t...