453 search results - page 20 / 91 » On Approximation of Bookmark Assignments |
IPL
2000
14 years 11 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
SAT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
JCO
2002
14 years 11 months ago
2002
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
CP
2006
Springer
15 years 3 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...