A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer ...
The Journal of Artificial Intelligence Research (JAIR) was one of the first scientific journals distributed over the Web. It has now completed over five years of successful public...
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...