2109 search results - page 71 / 422 » Solving Necklace Constraint Problems |
155
click to vote
AAAI
2006
15 years 6 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
136
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
143
click to vote
ICDT
2003
ACM
15 years 9 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
142
click to vote
EOR
2007
15 years 4 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
135
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...