116 search results - page 22 / 24 » On the solution-space geometry of random constraint satisfac... |
163
click to vote
FOCS
2007
IEEE
16 years 7 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
228
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
This paper presents a complete solution to estimating a scene’s 3D geometry and appearance from multiple 2D images by using a statistical inverse ray tracing method. Instead of ...
169
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
147
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...