118 search results - page 4 / 24 » An Evolutionary Random Policy Search Algorithm for Solving M... |
AAAI
1997
13 years 7 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
ATAL
2009
Springer
14 years 17 days ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
NIPS
2004
13 years 7 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
AMAI
2004
Springer
13 years 11 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
EC
2006
13 years 6 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...