613 search results - page 7 / 123 » Some Observations on Holographic Algorithms |
ECML
2005
Springer
14 years 1 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
LOGCOM
2008
13 years 7 months ago
2008
We look at the problem in belief revision of trying to make inferences about what an agent believed--or will believe--at a given moment, based on an observation of how the agent h...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
SIAMJO
2011
13 years 2 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...