4894 search results - page 696 / 979 » The Guarding Problem - Complexity and Approximation |
AAAI
2004
13 years 9 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
AAAI
2004
13 years 9 months ago
2004
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
CCCG
2006
13 years 9 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
ESANN
2004
13 years 9 months ago
2004
Abstract. In the context of nonlinear regression, we consider the problem of explaining a variable y from a vector x of explanatory variables and from a vector t of conditionning v...
IJCAI
2001
13 years 9 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...