Sciweavers

1389 search results - page 184 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
PPDP
2005
Springer
15 years 8 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
ICCSA
2005
Springer
15 years 8 months ago
Comparison of Global Optimization Methods for Drag Reduction in the Automotive Industry
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
Laurent Dumas, Vincent Herbert, Frédé...
CRYPTO
2001
Springer
202views Cryptology» more  CRYPTO 2001»
15 years 7 months ago
Revocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
Dalit Naor, Moni Naor, Jeffery Lotspiech
MOBIHOC
2008
ACM
16 years 2 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
FOCS
2005
IEEE
15 years 8 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy