413 search results - page 8 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
AAAI
2006
13 years 8 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
AAAI
1998
13 years 8 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
NDSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Third Generation (3G) cellular networks utilize timevarying and location-dependent channel conditions to provide broadband services. They employ opportunistic scheduling to effic...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
ECML
2005
Springer
14 years 19 days ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...