Sciweavers

510 search results - page 20 / 102
» How Should We Solve Search Problems Privately
Sort
View
HM
2007
Springer
120views Optimization» more  HM 2007»
14 years 1 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
A genetic algorithm for privacy preserving combinatorial optimization
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
Jun Sakuma, Shigenobu Kobayashi
SPW
2004
Springer
14 years 25 days ago
One User, Many Hats; and, Sometimes, No Hat: Towards a Secure Yet Usable PDA
How can we design a PDA that is at the same time secure and usable? In current implementations the two properties are mutually exclusive. Because normal users find password entry ...
Frank Stajano
ICC
2007
IEEE
165views Communications» more  ICC 2007»
14 years 1 months ago
Oblivious Keyword Search Protocols in the Public Database Model
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
Huafei Zhu, Feng Bao
IOR
2008
128views more  IOR 2008»
13 years 7 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer