6740 search results - page 1249 / 1348 » An s -Hamiltonian Line Graph Problem |
131
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
128
click to vote
SAS
2001
Springer
15 years 8 months ago
2001
Springer
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting...
130
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
137
Voted
HICSS
2000
IEEE
15 years 8 months ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
117
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...