Sciweavers

193 search results - page 15 / 39
» A PVS Based Framework for Validating Compiler Optimizations
Sort
View
CC
2004
Springer
14 years 2 months ago
Region-Based Partial Dead Code Elimination on Predicated Code
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
Qiong Cai, Lin Gao 0002, Jingling Xue
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 10 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
SOCO
2008
Springer
13 years 8 months ago
Composing Components and Services Using a Planning-Based Adaptation Middleware
Self-adaptive component-based architectures provide methods and mechanisms to support the dynamic adaptation of their structure under evolving execution context. Dynamic adaptation...
Romain Rouvoy, Frank Eliassen, Jacqueline Floch, S...
VMV
2007
122views Visualization» more  VMV 2007»
13 years 9 months ago
An iterative framework for registration with reconstruction
The core of most registration algorithms aligns scan data by pairs, minimizing their relative distance. This local optimization must generally pass through a validation procedure t...
Thales Vieira, Adelailson Peixoto, Luiz Velho, Tho...
CODES
2005
IEEE
14 years 2 months ago
Comparing the size of .NET applications with native code
Byte-code based languages are slowly becoming adopted in embedded domains because of improved security and portability. Another potential reason for their adoption is the reputati...
Roberto Costa, Erven Rohou