727 search results - page 50 / 146 » Private approximation of search problems |
132
click to vote
CIAC
1994
Springer
15 years 4 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
90
Voted
AAAI
2008
15 years 3 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
84
Voted
CORR
2004
Springer
15 years 15 days ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
111
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
108
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...