4469 search results - page 432 / 894 » Dynamic Program Slicing |
174
click to vote
ICDCS
2002
IEEE
15 years 12 months ago
2002
IEEE
The next generation of computing systems will be embedded, in a virtually unbounded number, and dynamically connected. The current software, network architectures, and their assoc...
179
Voted
PLDI
1998
ACM
15 years 10 months ago
1998
ACM
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
192
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
156
click to vote
PDPTA
2007
15 years 8 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
208
click to vote
CCCG
2003
15 years 8 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...