1088 search results - page 85 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
ECAI
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
AAAI
2010
13 years 12 months ago
2010
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
We propose an object detection method using particle filters. Our approach estimates the probability of object presence in the current image given the history of observations up t...