465 search results - page 24 / 93 » On the Hardness of Range Assignment Problems |
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
AAAI
2004
15 years 1 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...
EVOW
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In domains such as music and visual art, where the quality of an individual often depends on subjective or hard to express concepts, the automating fitness assignment bec...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We study the problem of designing motionplanning and sensor assignment strategies for tracking multiple targets with a mobile sensor network. We focus on triangulation ...