2725 search results - page 240 / 545 » Constraint Solving for Interpolation |
239
click to vote
CP
2005
Springer
16 years 23 days ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
194
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
197
click to vote
ECCV
1998
Springer
16 years 9 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
199
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
174
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...