4114 search results - page 388 / 823 » Efficient Algorithms for the 2-Center Problems |
175
click to vote
ENTCS
2008
15 years 6 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
175
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
We introduce a new approach to the problem of collision detection in multi-axis NC-machining. Due to the directional nature (tool axis) of multi-axis NCmachining, space subdivisio...
152
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
203
click to vote
NIPS
2001
15 years 8 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
174
click to vote
JDA
2008
15 years 6 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...