Sciweavers

866 search results - page 48 / 174
» Bidirectionalizing graph transformations
Sort
View
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
15 years 2 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
FASE
2007
Springer
15 years 3 months ago
Information Preserving Bidirectional Model Transformations
Abstract. Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Frank...
COR
2006
93views more  COR 2006»
14 years 9 months ago
Solving capacitated arc routing problems using a transformation to the CVRP
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
Humberto Longo, Marcus Poggi de Aragão, Edu...
CC
2001
Springer
177views System Software» more  CC 2001»
15 years 2 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
IPL
2006
98views more  IPL 2006»
14 years 9 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...