Sciweavers

6110 search results - page 48 / 1222
» Approximate Computing
Sort
View
COMGEO
2004
ACM
15 years 2 months ago
Approximating geometric bottleneck shortest paths
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, ...
CSR
2009
Springer
15 years 3 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
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...
Peter Jonsson, Johan Thapper
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 8 months ago
Horn Upper Bounds and Renaming
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...
Marina Langlois, Robert H. Sloan, György Tur&...