Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
: We present a method for representing, communicating, and fusing distributed, noisy, and uncertain observations of an object by multiple robots. The approach relies on re-paramete...
Ashley W. Stroupe, Martin C. Martin, Tucker R. Bal...