459 search results - page 56 / 92 » Computational Complexity of Probabilistic Disambiguation |
120
click to vote
JAIR
2008
14 years 11 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
RAS
1998
14 years 11 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
108
click to vote
AI
2008
Springer
14 years 10 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
113
click to vote
IEEEARES
2008
IEEE
15 years 6 months ago
2008
IEEE
Reliability analysis has become an integral part of system design and operating. This is especially true for systems performing critical tasks such as mass transportation systems....
127
click to vote
MMAS
2011
Springer
14 years 6 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...