201 search results - page 19 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
112
click to vote
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
117
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
196
click to vote
GIS
2007
ACM
2007
ACM
Exploiting automatically inferred constraint-models for building identification in satellite imagery
16 years 2 months ago
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
79
Voted
IJCAI
2003
15 years 2 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
106
click to vote
NETWORKS
2008
15 years 1 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...