We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Let be a preference relation on a convex set F. Necessary and sufficient conditions are given that guarantee the existence of a set {ul} of affine utility functions on F such th...