1300 search results - page 166 / 260 » Constraint satisfaction problems and global cardinality cons... |
CODES
1998
IEEE
15 years 2 months ago
1998
IEEE
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
IJCNN
2006
IEEE
15 years 3 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
CCIA
2005
Springer
15 years 3 months ago
2005
Springer
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
102
click to vote
OL
2007
14 years 9 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
Motion blur retains some information about motion, based on which motion may be recovered from blurred images. This is a difficult problem, as the situations of motion blur can be...