1844 search results - page 83 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
73
Voted
CP
2009
Springer
15 years 6 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
113
click to vote
VTC
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper derives the optimum non-uniform quantization scheme for a distributed estimation problem based on noisy observations in a wireless sensor network. The optimal quanti...
JAIR
2007
14 years 11 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
104
click to vote
FLAIRS
2008
15 years 1 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
CVPR
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...