403 search results - page 26 / 81 » A testing scenario for probabilistic processes |
CORR
1998
Springer
13 years 8 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
ACL
1993
13 years 9 months ago
1993
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
CVPR
2004
IEEE
14 years 10 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, ...
SIGIR
2003
ACM
14 years 1 months ago
2003
ACM
This paper presents an algorithm to generate possible variants for biomedical terms. The algorithm gives each variant its generation probability representing its plausibility, whi...
GECCO
2006
Springer
14 years 5 days ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...