1102 search results - page 36 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
KBS
2007
13 years 9 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
EOR
2007
13 years 9 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
ICRA
1999
IEEE
14 years 1 months ago
1999
IEEE
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...
EOR
2010
13 years 9 months ago
2010
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is ...
ASPDAC
2010
ACM
13 years 7 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...