100 search results - page 12 / 20 » Optimizing Address Assignment for Scheduling Embedded DSPs |
CODES
2003
IEEE
14 years 22 days ago
2003
IEEE
the level of abstraction in system design promises to enable faster exploration of the design space at early stages. While scheduling decision for embedded software has great impa...
RTCSA
2003
IEEE
14 years 22 days ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
ADAEUROPE
2004
Springer
14 years 26 days ago
2004
Springer
This paper presents a modification of GLADE —the current GNAT implementation of the Ada 95 Distributed Systems Annex (DSA)— to support the development of distributed applicatio...
CP
2005
Springer
14 years 1 months 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...
CONSTRAINTS
2006
13 years 7 months ago
2006
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...