246 search results - page 20 / 50 » Dynamic Local Search for the Maximum Clique Problem |
136
Voted
SAC
2004
ACM
15 years 9 months 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...
242
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
157
Voted
JPDC
2010
15 years 2 months ago
2010
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
124
Voted
CP
2004
Springer
15 years 7 months ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
131
click to vote
AAAI
2000
15 years 5 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...