9842 search results - page 1693 / 1969 » Compositional timing analysis |
131
Voted
JACM
1998
15 years 3 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
123
Voted
JSS
2002
15 years 3 months ago
2002
The search for and correction of errors in software are often time consuming and expensive components of the total cost of software development. The current research investigates ...
119
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
111
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
127
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...