Sciweavers

1802 search results - page 157 / 361
» Complexity Theory for Operators in Analysis
Sort
View
CCR
2004
151views more  CCR 2004»
15 years 6 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster
ICST
2010
IEEE
15 years 4 months ago
Automated Test Data Generation on the Analyses of Feature Models: A Metamorphic Testing Approach
A Feature Model (FM) is a compact representation of all the products of a software product line. The automated extraction of information from FMs is a thriving research topic invo...
Sergio Segura, Robert M. Hierons, David Benavides,...
EDBTW
2010
Springer
16 years 1 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
FOCS
2002
IEEE
15 years 11 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir
AMAST
2006
Springer
15 years 10 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante