14078 search results - page 1924 / 2816 » Design and Analysis of Computer Algorithms |
202
click to vote
AAAI
2004
15 years 9 months ago
2004
We study a form of the pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can...
175
click to vote
UAI
2004
15 years 9 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
189
click to vote
BMVC
1998
15 years 9 months ago
1998
Many techniques have been reported for handwriting-based writer identification. Most such techniques assume that the written text is fixed (e.g., in signature verification). In th...
209
click to vote
CONEXT
2009
ACM
15 years 8 months ago
2009
ACM
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein eac...
242
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...