In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Open source projects do have requirements; they are, however, mostly informal, text descriptions found in requests, forums, and other correspondence. Understanding of such require...
We examine patterns of participation by employees who are members of multiple online communities in an enterprise communities service. Our analysis focuses on statistical patterns...
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
The BDI agent model comprises a simple but efficient folk psychological framework of mentalistic notions usable for modeling rational agent behaviour. Nevertheless, despite its u...
Alexander Pokahr, Lars Braubach, Winfried Lamersdo...