14 search results - page 2 / 3 » Greedy and Heuristic Algorithms for Codes and Colorings |
DATE
2004
IEEE
13 years 8 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
ICCS
2004
Springer
13 years 10 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
EGITALY
2006
13 years 6 months ago
2006
Palette re-ordering is a well known and very effective approach for improving the compression of color-indexed images. If the spatial distribution of the indexes in the image is s...
LCTRTS
2007
Springer
13 years 11 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...