Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...
We have recently presented CarpeDiem, an algorithm that can be used for speeding up the evaluation of Supervised Sequential Learning (SSL) classifiers. CarpeDiem provides impress...
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
This paper describes the philosophy behind our tool called “Legal Taxonomy Syllabus”, the analytical instruments it provides and some case studies. The Legal Taxonomy Syllabus...
This article describes the application of computational decision analytic techniques for a national policy decision. It constitutes an example of the increasing use of modern comp...