152 search results - page 31 / 31 » Discovering Identity Problems: A Case Study |
CC
1998
Springer
13 years 5 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...