4066 search results - page 6 / 814 » Improved Algorithms and Analysis for Secretary Problems and ... |
PEPM
1995
ACM
13 years 11 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
LION
2007
Springer
14 years 1 months ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
HIS
2009
13 years 5 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...