14 search results - page 1 / 3 » Greedy and Heuristic Algorithms for Codes and Colorings |
TIT
1998
13 years 4 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
ATS
2004
IEEE
13 years 8 months ago
2004
IEEE
Test data volume and scan power are two major concerns in SoC test. In this paper we present an alternative run-length coding method through scan chain reconfiguration to reduce b...
GECCO
2004
Springer
13 years 9 months ago
2004
Springer
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
HEURISTICS
2008
13 years 4 months ago
2008
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
CC
2006
Springer
13 years 8 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...