The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
Gas chemical sensors are strongly affected by the so-called drift, i.e., changes in sensors’ response caused by poisoning and aging that may significantly spoil the measures g...
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
There are two types of collaborative filtering (CF) systems, user-based and item-based. This paper introduces an item-based CF system for ranking derived from Linear Associative ...