363 search results - page 60 / 73 » Decomposition of the NVALUE constraint |
CP
2004
Springer
15 years 3 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
101
click to vote
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
102
click to vote
SIGGRAPH
1992
ACM
15 years 1 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
113
click to vote
COCOS
2003
Springer
15 years 2 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
116
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper describes a dynamic voltage and frequency scaling (DVFS) technique for MPEG decoding to reduce the energy consumption using the computational workload decomposition. Th...