973 search results - page 147 / 195 » Updating computer science education |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
ITICSE
2006
ACM
15 years 3 months ago
2006
ACM
We apply the Jigsaw cooperative learning model to our CS1 closed labs. The Jigsaw cooperative learning model assigns students into main groups in which each group member is respon...
CHI
2004
ACM
15 years 3 months ago
2004
ACM
We introduce Topobo, a 3D constructive assembly system embedded with kinetic memory, the ability to record and playback physical motion. Unique among modeling systems is Topoboʼs...