121 search results - page 13 / 25 » A New Exam Scheduling Algorithm Using Graph Coloring |
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
DATE
1997
IEEE
13 years 11 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...