8651 search results - page 1409 / 1731 » Intelligent agents as innovations |
136
click to vote
AAAI
2010
15 years 8 months ago
2010
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
171
click to vote
AAAI
2010
15 years 8 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
179
click to vote
AAAI
2010
15 years 8 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
176
click to vote
AAAI
2010
15 years 8 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
158
click to vote
AAAI
2010
15 years 8 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...