510 search results - page 24 / 102 » How Should We Solve Search Problems Privately |
WINE
2007
Springer
14 years 1 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
AAAI
2010
13 years 9 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
COR
2007
13 years 7 months ago
2007
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
AIPS
2004
13 years 9 months ago
2004
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
ECCC
2007
13 years 7 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...