658 search results - page 37 / 132 » Partially Ordered Constraint Optimization Problems |
112
click to vote
JMLR
2012
13 years 4 days ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...