9818 search results - page 314 / 1964 » Much Support and More |
182
click to vote
TODAES
2008
15 years 6 months ago
2008
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
159
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using othe...
151
click to vote
ENTCS
2000
15 years 6 months ago
2000
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
168
click to vote
JSAC
1998
15 years 6 months ago
1998
—We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated convolutional codes. One computes its recursions at only M st...
199
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...