510 search results - page 14 / 102 » How Should We Solve Search Problems Privately |
CPAIOR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
DAGSTUHL
2007
13 years 9 months ago
2007
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
CIAC
2000
Springer
13 years 11 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliab...