2045 search results - page 137 / 409 » Learning programming with Erlang |
CHI
2000
ACM
14 years 13 days ago
2000
ACM
We can reliably build “second generation” intelligent computer tutors that are approximately half as effective as human tutors. This paper evaluates two interface enhancements...
SIGCSE
1997
ACM
14 years 7 days ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
AAAI
2008
13 years 10 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
FLAIRS
2006
13 years 9 months ago
2006
We have been using the concept map of the domain, enhanced with pedagogical concepts called learning objectives, as the overlay student model in our intelligent tutors for program...
ML
2010
ACM
13 years 6 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...