16596 search results - page 188 / 3320 » Generalized Assignment Problems |
102
click to vote
CPAIOR
2004
Springer
15 years 8 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
147
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
IJCAI
1989
15 years 3 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
107
Voted
PAMI
2006
15 years 2 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
134
click to vote
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...