If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Effective business processes must be able to accommodate changes in the environment in which they operate, e.g., new laws, changes in business strategy. The ability to encompass su...
Helen Schonenberg, Ronny Mans, Nick Russell, Natal...
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Abstract. With the advent of the Semantic Web, the question becomes important how to best combine open-world based ontology languages, like OWL, with closed-world rules paradigms. ...
Current networked society present learners with challenges that cannot be sufficiently coped with in educational contexts that are characterized by transmission or participation ep...