13987 search results - page 143 / 2798 » The Two Guards Problem |
140
click to vote
PKC
2010
Springer
15 years 1 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
118
click to vote
SLS
2007
Springer
15 years 9 months ago
2007
Springer
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
135
Voted
CCCG
2010
15 years 5 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
126
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
131
Voted
IPL
2006
15 years 3 months ago
2006
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...