327 search results - page 21 / 66 » Exploiting Problem Decomposition in Multi-objective Constrai... |
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
CPAIOR
2006
Springer
14 years 11 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
88
Voted
ICDT
2003
ACM
15 years 2 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...