149 search results - page 23 / 30 » Optimal Scheduling of Contract Algorithms with Soft Deadline... |
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
MM
2009
ACM
15 years 4 months ago
2009
ACM
As more and more video content is made available and accessed on-demand, content and service providers face challenges of scale. Today’s delivery mechanisms, especially unicast,...
COMPSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
IOR
2007
14 years 9 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
CP
2003
Springer
15 years 2 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...