6315 search results - page 51 / 1263 » Approximating Solution Structure |
111
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 2 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
113
Voted
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
86
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
94
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
86
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer