4595 search results - page 184 / 919 » Reasoning about Plans |
214
click to vote
AIPS
2006
15 years 8 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
236
click to vote
DALT
2005
Springer
16 years 21 days ago
2005
Springer
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...
195
click to vote
IJCAI
1993
15 years 8 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
235
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
201
click to vote
ICTAI
2000
IEEE
15 years 10 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...