1736 search results - page 294 / 348 » The rank-width of Directed Graphs |
119
click to vote
HCW
1999
IEEE
15 years 4 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
97
Voted
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
174
Voted
PLDI
1998
ACM
15 years 4 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...
106
click to vote
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
69
Voted
DATE
1997
IEEE
15 years 4 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...