Sciweavers

1844 search results - page 18 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
UAI
2000
15 years 14 days ago
Exploiting Qualitative Knowledge in the Learning of Conditional Probabilities of Bayesian Networks
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
Frank Wittig, Anthony Jameson
68
Voted
CVPR
2010
IEEE
14 years 11 months ago
Exploiting Monge structures in optimum subwindow search
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
Senjian An, Patrick Peursum, Wanquan Liu, Svetha V...
AI
2005
Springer
14 years 11 months ago
Adopt: asynchronous distributed constraint optimization with quality guarantees
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
ATAL
2006
Springer
15 years 2 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CP
2004
Springer
15 years 4 months ago
Preprocessing Techniques for Distributed Constraint Optimization
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
Syed Muhammad Ali, Sven Koenig, Milind Tambe