403 search results - page 18 / 81 » Variable ranges in linear constraints |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
ESA
2006
Springer
14 years 3 days ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
IJCAI
1989
13 years 9 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we consider the problem of classification in the presence of pairwise constraints, which consist of pairs of examples as well as a binary variable indicating whether...