2354 search results - page 113 / 471 » Assignment Problems |
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
135
Voted
CSCLP
2006
Springer
15 years 5 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
101
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
113
Voted
GD
2006
Springer
15 years 5 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
130
click to vote
IJCAI
2003
15 years 3 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...