This paper describes an initiative at North Carolina State University in which the undergraduate software engineering class was restructured in layout and in presentation. The cha...
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
Abstract. This work extends studies of Angluin, Lange and Zeugmann on the dependence of learning on the hypotheses space chosen for the class. In subsequent investigations, uniform...
Collaborative work is an important part of tertiary education but it is very difficult to arrange and supervise for extremely large classes of students in their first year. The po...
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...