125 search results - page 12 / 25 » N Semantic Classes are Harder than Two |
DISOPT
2007
14 years 9 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
ICTCS
2003
Springer
15 years 2 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
CATA
2004
14 years 11 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
JCSS
2011
14 years 4 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...