4894 search results - page 869 / 979 » The Guarding Problem - Complexity and Approximation |
IJCAI
1993
13 years 9 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
MVA
1996
13 years 9 months ago
1996
Since conventional correlation-based visual tracking algorithms are based on a single reference block, they often fail to track a target in the following situations: 1) a view of ...
AAAI
1992
13 years 9 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
IJCAI
1989
13 years 9 months ago
1989
In designing autonomous agents that deal competently with issues involving time and space, there is a tradeoff to be made between guaranteed response-time reactions on the one han...
AIPS
2009
13 years 9 months ago
2009
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...