13987 search results - page 489 / 2798 » The Two Guards Problem |
199
click to vote
UAI
2003
15 years 8 months ago
2003
Learning with hidden variables is a central challenge in probabilistic graphical models that has important implications for many real-life problems. The classical approach is usin...
178
click to vote
AIPS
2009
15 years 8 months ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
165
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
189
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
170
click to vote
ICDE
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract— Nowadays, vast amount of routing data, like sequences of points of interests, landmarks, etc., are available due to the proliferation of geodata services. We refer to t...