Sciweavers

163 search results - page 6 / 33
» Improving the Context-sensitive Dependency Graph
Sort
View
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 8 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
TROB
2008
128views more  TROB 2008»
13 years 7 months ago
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
Brian Shucker, Todd D. Murphey, John K. Bennett
IWPC
2009
IEEE
14 years 2 months ago
Variable granularity for improving precision of impact analysis
Impact analysis is a specialized process of program comprehension that investigates the nature and extent of a planned software change. Traditionally, impact analysis inspects dep...
Maksym Petrenko, Václav Rajlich
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
SCAM
2003
IEEE
14 years 24 days ago
Improving the Static Analysis of Loops by Dynamic Partitioning Techniques
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
Matthieu Martel