3204 search results - page 605 / 641 » The Alcuin Number of a Graph |
IEEEPACT
1998
IEEE
15 years 2 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
125
click to vote
PLDI
1998
ACM
15 years 2 months ago
1998
ACM
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
ESA
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
105
click to vote
EUROPAR
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...