221 search results - page 10 / 45 » Twinkle: programming with color |
ICALP
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
DAM
2002
14 years 10 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
CC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...
LCTRTS
2007
Springer
15 years 4 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. ...
TSP
2010
14 years 4 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...