134 search results - page 26 / 27 » On the Complexity of Computing Values of Restricted Games |
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
VIS
2004
IEEE
15 years 11 months ago
2004
IEEE
ImageSurfer is a tool designed to explore correlations between two 3D scalar fields. Our scientific goal was to determine where a protein is located, and how much its concentratio...
100
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
156
click to vote
AGP
2010
IEEE
15 years 2 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...