Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
Abstract. A groupware that integrates synchronous and asynchronous collaboration paradigms is developed to support international medical collaboration activities carried out among ...
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...
: In this paper, a new approach for leaf recognition using the result of segmentation of leaf’s skeleton based on the combination of wavelet transform (WT) and Gaussian interpola...
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...