Sciweavers

1153 search results - page 222 / 231
» Reversing graph transformations
Sort
View
CGO
2003
IEEE
13 years 11 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
GRAPHICSINTERFACE
2007
13 years 9 months ago
Can smooth view transitions facilitate perceptual constancy in node-link diagrams?
Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during...
Maruthappan Shanmugasundaram, Pourang Irani, Carl ...
HPDC
2010
IEEE
13 years 8 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
SAC
2010
ACM
13 years 7 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 7 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...