In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
In spatial data mining, a common task is the discovery of spatial association rules from spatial databases. We propose a distributed system, named ARES that takes advantage of the ...
In this paper we propose an original approach to apply data mining algorithms, namely decision tree-based methods, taking into account not only the size of processed databases but ...