2747 search results - page 105 / 550 » Non-oblivious Strategy Improvement |
168
click to vote
ANLP
1992
15 years 7 months ago
1992
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
173
click to vote
ISMB
1996
15 years 7 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
147
click to vote
CATA
2009
15 years 7 months ago
2009
Highly varying job demands generally consist of many short jobs mixed with several long jobs. In this paper, we consider a simple scenario where two job streams with different lev...
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Capacity gain from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static channels, when all nodes...
160
click to vote
TC
2008
15 years 6 months ago
2008
While many block replacement algorithms for buffer caches have been proposed to address the wellknown drawbacks of the LRU algorithm, they are not robust and cannot maintain a cons...