Sciweavers

656 search results - page 51 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 11 days ago
Modal and transition dwell time computation in switching systems: a set-theoretic approach
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Franco Blanchini, Daniele Casagrande, Stefano Mian...
WG
2010
Springer
13 years 6 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
FOCS
2005
IEEE
14 years 1 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
GG
2004
Springer
14 years 1 months ago
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
Paolo Baldan, Barbara König, Ingo Stürme...
GG
2004
Springer
14 years 1 months ago
Translating Java Code to Graph Transformation Systems
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules incl...
Andrea Corradini, Fernando Luís Dotti, Luci...