Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
The two separate projects described have examined how teachers exploit computer-based technologies in supporting learning of science at secondary level. This paper examines how pe...
Sara Hennessy, Jocelyn Wishart, Denise Whitelock, ...
Abstract: Although immense efforts have been invested in the construction of hundreds of learning object repositories, the degree of reuse of learning resources maintained in such ...
Purpose – The purpose of this paper, drawing as it does on earlier research, is to provide the context for a discussion on the use of rewards and recognition programmes in knowl...