1029 search results - page 76 / 206 » Probabilistic Recurrence Relations |
99
Voted
IJAR
2008
15 years 3 months ago
2008
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
101
click to vote
ENTCS
2007
15 years 3 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
67
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
—This paper introduces a new algorithm for probabilistic motion planning in arbitrary, uncertain vector fields, with emphasis on high-level planning for Montgolfier´e balloons...
137
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, ...
133
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Service discovery is one of challenging issues in Service-Oriented computing. Currently, most of the existing service discovering and matching approaches are based on keywords-bas...