914 search results - page 50 / 183 » The Computational Complexity of Probabilistic Planning |
138
click to vote
CMSB
2009
Springer
15 years 10 months ago
2009
Springer
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
149
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
143
click to vote
JCST
2010
14 years 11 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
123
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
119
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...