510 search results - page 3 / 102 » How Should We Solve Search Problems Privately |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalen...
JAR
2000
13 years 7 months ago
2000
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
JSAT
2008
13 years 7 months ago
2008
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Social networking and content sharing service providers, e.g., Facebook and Google Maps, enable their users to upload and share a variety of user-generated content, including locat...
TEC
2002
13 years 7 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...