4843 search results - page 859 / 969 » The Shortcut Problem - Complexity and Approximation |
87
Voted
AAAI
1992
14 years 11 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
14 years 11 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
14 years 11 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...
73
Voted
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Recent work has applied game-theoretic models to real-world security problems at the Los Angeles International Airport (LAX) and Federal Air Marshals Service (FAMS). The analysis o...