1041 search results - page 59 / 209 » Randomizing Reductions of Search Problems |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
JAIR
2006
13 years 8 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...