Sciweavers

1554 search results - page 26 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
COMPSAC
2007
IEEE
15 years 4 months ago
Learning Parameterized State Machine Model for Integration Testing
Although many of the software engineering activities can now be model-supported, the model is often missing in software development. We are interested in retrieving statemachine m...
Muzammil Shahbaz, Keqin Li 0002, Roland Groz
CORR
2007
Springer
109views Education» more  CORR 2007»
14 years 10 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
DAC
2006
ACM
15 years 11 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
ICPADS
1998
IEEE
15 years 2 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
ESA
2009
Springer
159views Algorithms» more  ESA 2009»
15 years 4 months ago
Contraction Bidimensionality: The Accurate Picture
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...