13987 search results - page 784 / 2798 » The Two Guards Problem |
202
click to vote
DCG
2000
15 years 7 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
202
click to vote
CSCW
2002
ACM
15 years 7 months ago
2002
ACM
Good real time groupware products are hard to develop, in part because evaluating their support for basic teamwork activities is difficult and costly. To address this problem, we ...
205
click to vote
IJCV
2000
15 years 7 months ago
2000
We investigate the properties of a metric between two distributions, the Earth Mover's Distance (EMD), for content-based image retrieval. The EMD is based on the minimal cost ...
198
click to vote
JAIR
2000
15 years 7 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
192
click to vote
JAR
2000
15 years 7 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...