311 search results - page 5 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
TSP
2011
13 years 2 months ago
2011
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
IOR
2011
13 years 2 months ago
2011
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
CONSTRAINTS
2006
13 years 7 months ago
2006
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...