1816 search results - page 45 / 364 » A New Approach for Solving the Maximum Clique Problem |
AAAI
2006
15 years 1 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...
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we propose a new analytical model for throughput evaluation of wireless network coding. This new approach is based on a probabilistic viewpoint on network coding, i....
CP
2009
Springer
14 years 9 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
102
click to vote
ANOR
2011
14 years 3 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...