1844 search results - page 37 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
112
click to vote
FOCM
2010
14 years 9 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
CP
2007
Springer
15 years 5 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
126
click to vote
ICIP
1999
IEEE
16 years 22 days ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...