In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
With the ever-increasing numbers of cores per node on HPC systems, applications are increasingly using threads to exploit the shared memory within a node, combined with MPI across ...
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
The success of Wikipedia has demonstrated the power of peer production in knowledge building. However, unlike many other examples of collective intelligence, tasks in Wikipedia ca...