633 search results - page 52 / 127 » Locality and Hard SAT-Instances |
IPPS
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
3DIC
2009
IEEE
14 years 3 months ago
2009
IEEE
Several forms of processor memory organizations have been in use to optimally access off-chip memory systems mainly the Hard disk drives (HDD). Recent trends show that the solid s...
CAV
2009
Springer
14 years 2 months ago
2009
Springer
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
EVOW
2001
Springer
14 years 2 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...