311 search results - page 8 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
102
Voted
AAAI
2007
14 years 12 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
88
Voted
COLOGNETWENTE
2008
14 years 11 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
IJCAI
2007
14 years 11 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
71
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
80
Voted
PARA
1995
Springer
15 years 1 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...