2178 search results - page 136 / 436 » Inferring complex plans |
126
click to vote
CATS
2007
15 years 5 months ago
2007
This paper provides a theoretical basis for performing time limited planning within Belief-Desire-Intention (BDI) agents. The BDI agent architecture is recognised as one of the mo...
154
click to vote
JAIR
2008
15 years 3 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
158
click to vote
INFORMATICALT
2007
15 years 3 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
132
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
168
click to vote
CNSM
2010
14 years 10 months ago
2010
This paper describes an approach for designing a power management plan that matches the supply of power with the demand for power in data centers. Power may come from the grid, fro...