291 search results - page 30 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
IPCO
1998
13 years 9 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
ESA
2003
Springer
14 years 28 days ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
NOMS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We study the problem of dynamic resource allocation to clustered Web applications. We extend application server middleware with the ability to automatically decide the s...
CSCLP
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
In recent years integrating multiprocessors in a single chip is emerging for supporting various scientific and commercial applications, with diverse demands to the underlying on-c...