36 search results - page 4 / 8 » Solving the maximum clique problem by k-opt local search |
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...
SAC
2004
ACM
14 years 26 days ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
AAAI
2000
13 years 8 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....