Sciweavers

439 search results - page 43 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
ATAL
2008
Springer
13 years 10 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
AAAI
2006
13 years 10 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
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...
Jinbo Huang, Mark Chavira, Adnan Darwiche
DAWAK
2001
Springer
14 years 1 months ago
Discovering Web Document Associations for Web Site Summarization
Complex web information structures prevent search engines from providing satisfactory context-sensitive retrieval. We see that in order to overcome this obstacle, it is essential t...
K. Selçuk Candan, Wen-Syan Li
CVPR
2003
IEEE
14 years 2 months ago
ROD-TV: Reconstruction on Demand by Tensor Voting
A “graphics for vision” approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV...
Wai-Shun Tong, Chi-Keung Tang