3825 search results - page 338 / 765 » The Language of Time: A Reader |
182
click to vote
PLDI
1995
ACM
15 years 10 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
181
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
153
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
155
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
204
click to vote
SEDE
2007
2007
A framework for constraint checking involving aggregates for multiple XML databases using schematron
15 years 8 months ago
Many internet and enterprise applications now not only use XML (eXtensible Markup Language) as a medium for communication but also for storing their data either temporarily for an...