Sciweavers

2941 search results - page 149 / 589
» The Myth of the Educational Computer
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 4 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
CORR
2004
Springer
87views Education» more  CORR 2004»
15 years 4 months ago
Exploring tradeoffs in pleiotropy and redundancy using evolutionary computing
Evolutionary computation algorithms are increasingly being used to solve optimization problems as they have many advantages over traditional optimization algorithms. In this paper...
Matthew J. Berryman, Wei-Li Khoo, Hiep Nguyen, Eri...
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 11 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
SIGCSE
2003
ACM
137views Education» more  SIGCSE 2003»
15 years 9 months ago
Measuring the effectiveness of robots in teaching computer science
We report the results of a year-long experiment in the use of robots to teach computer science. Our data set compares results from over 800 students on identical tests from both r...
Barry S. Fagin, Laurence D. Merkle
JCDL
2010
ACM
151views Education» more  JCDL 2010»
15 years 6 months ago
Domain-specific iterative readability computation
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
Jin Zhao, Min-Yen Kan