42 search results - page 3 / 9 » Efficient Haplotype Inference with Combined CP and OR Techni... |
EAAI
2008
13 years 5 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
CP
2004
Springer
13 years 11 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
CVPR
2003
IEEE
14 years 7 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
ICIP
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
UAI
2000
13 years 7 months ago
2000
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...