2266 search results - page 234 / 454 » Some Solutions to the Ignoring Problem |
156
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
169
click to vote
RSS
2007
15 years 8 months ago
2007
Abstract— We address the problem of surveillance in an environment with obstacles. We show that the problem of tracking an evader with one pursuer around one corner is completely...
170
click to vote
PUK
2001
15 years 8 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
160
click to vote
JAIR
2008
15 years 6 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
165
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...