2223 search results - page 408 / 445 » Ontological Framework for Approximation |
113
click to vote
AIPS
2009
15 years 1 months ago
2009
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
123
Voted
ALMOB
2006
15 years 22 days ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
111
Voted
CORR
2006
Springer
15 years 21 days ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
126
click to vote
JMLR
2006
15 years 19 days ago
2006
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
103
Voted
BMCBI
2005
15 years 17 days ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...