29 search results - page 1 / 6 » Approximability of the Maximum Solution Problem for Certain ... |
CSR
2009
Springer
13 years 5 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
CP
2006
Springer
13 years 8 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
MFCS
2005
Springer
13 years 9 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
SIAMMAX
2010
12 years 11 months ago
2010
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...