2107 search results - page 162 / 422 » Computing Small Search Numbers in Linear Time |
130
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
119
Voted
NIPS
2004
15 years 5 months ago
2004
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
116
Voted
ALMOB
2008
15 years 3 months ago
2008
Background: Experimental identification of microRNA (miRNA) targets is a difficult and time consuming process. As a consequence several computational prediction methods have been ...
133
Voted
PODC
2010
ACM
15 years 7 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
139
Voted
JCSS
2002
15 years 3 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...