Our research aims to detect the impact of various cultural variables on search behaviour. We tested our hypotheses by examining users' navigation steps recorded in a large lo...
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
The greedy search approach to variable selection in regression trees with constant fits is considered. At each node, the method usually compares the maximally selected statistic a...
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...