3637 search results - page 358 / 728 » On Dynamic Bit-Probe Complexity |
149
click to vote
UAI
1996
15 years 8 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
148
Voted
ENVSOFT
2008
15 years 6 months ago
2008
Water quality modelling in small rivers is often considered unworthy from a practical and economic viewpoint. This paper shows instead that a simple model structure can be set up ...
124
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The aim of this paper is to propose a method for tagging named entities (NE), using natural language processing techniques. Beyond their literal meaning, named entities are freque...
143
click to vote
RAS
2006
15 years 6 months ago
2006
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
162
click to vote
JAIR
2007
15 years 6 months ago
2007
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...