1171 search results - page 76 / 235 » Variable neighborhood search |
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
AAAI
2006
14 years 11 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...
INFORMATICALT
2006
14 years 9 months ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
SIAMCOMP
2002
14 years 9 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...