Sciweavers

12597 search results - page 296 / 2520
» Complexity of Mechanism Design
Sort
View
WG
2010
Springer
15 years 5 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter
NFM
2011
335views Formal Methods» more  NFM 2011»
15 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
ICSE
2010
IEEE-ACM
15 years 11 months ago
An analysis of the variability in forty preprocessor-based software product lines
Over 30 years ago, the preprocessor cpp was developed to extend the programming language C by lightweight metaprogramming capabilities. Despite its error-proneness and low ion lev...
Jörg Liebig, Sven Apel, Christian Lengauer, C...
190
Voted
WWW
2008
ACM
16 years 7 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
ICDCS
2012
IEEE
13 years 9 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...