327 search results - page 9 / 66 » Exploiting Problem Decomposition in Multi-objective Constrai... |
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...
IJCV
2000
13 years 7 months ago
2000
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
COR
2006
13 years 7 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
AAAI
2007
13 years 9 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...