Sciweavers

3356 search results - page 148 / 672
» Computing education for sustainability
Sort
View
SIGCSE
2000
ACM
137views Education» more  SIGCSE 2000»
15 years 11 months ago
Evaluating programming ability in an introductory computer science course
There are numerous ways to evaluate student programming ability, all of which have benefits and drawbacks. In this paper we discuss how we have combined a number of those evaluati...
A. T. Chamillard, Kim A. Braun
CORR
2004
Springer
116views Education» more  CORR 2004»
15 years 6 months ago
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uy...
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 6 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
SIGCSE
2002
ACM
135views Education» more  SIGCSE 2002»
15 years 6 months ago
Introducing computer science through animation and virtual worlds
We describe a course for non-majors that teaches computer science concepts and programming by creating simple animations and building 2D and 3D virtual worlds. Students work with ...
Susan H. Rodger
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 3 months ago
Infinite Time Cellular Automata: A Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
Fabien Givors, Grégory Lafitte, Nicolas Oll...