943 search results - page 147 / 189 » How should data structures and algorithms be taught |
EPS
1997
Springer
14 years 6 days ago
1997
Springer
Genetic Programming is increasing in popularity as the basis for a wide range of learning algorithms. However, the technique has to date only been successfully applied to modest t...
AIMSA
2006
Springer
13 years 11 months ago
2006
Springer
Effective automatic summarization usually requires simulating asoning such as abstraction or relevance reasoning. In this paper we describe a solution for this type of reasoning in...
ITICSE
2010
ACM
13 years 10 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
COMAD
2008
13 years 9 months ago
2008
Semantic information helps in identifying the context of a document. It will be interesting to find out how effectively this information can be used in recommending related docume...
CADE
2010
Springer
13 years 9 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...