465 search results - page 33 / 93 » On the Hardness of Range Assignment Problems |
137
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
143
click to vote
CP
2005
Springer
15 years 5 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
109
click to vote
CONSTRAINTS
2006
14 years 12 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
105
click to vote
STOC
2006
ACM
16 years 4 days ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
JACM
2007
14 years 11 months ago
2007
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...