A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
In this paper a novel procedure to select the input nodes in neural network modeling is presented and discussed. The approach is developed in a multiple testing framework and so it...
Contrary to the apparent beliefs of many students, computer programming and problem solving are not amenable to purely book learning. These skills can be acquired only by practice...
The case study method supported by interviews is used widely by IS researchers. In `messy' problems, such as the adoption of e-procurement across manufacturing supply chains,...