3082 search results - page 19 / 617 » New Bounds for the Controller Problem |
125
Voted
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
138
Voted
DAC
1995
ACM
15 years 7 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
109
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
125
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
110
click to vote
COMPUTING
2007
15 years 3 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...