960 search results - page 23 / 192 » Optimal Monte Carlo Algorithms |
AAAI
2010
13 years 9 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
ICRA
1999
IEEE
13 years 12 months ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
AIPS
2006
13 years 9 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
AI
2008
Springer
13 years 7 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
PRL
2006
13 years 7 months ago
2006
A robust and effective feature map integration method is presented for infrared (IR) target recognition. Noise in an IR image makes a target recognition system unstable in pose es...