Sciweavers

269 search results - page 42 / 54
» Reversible structures
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
ICSE
2005
IEEE-ACM
14 years 7 months ago
Binary refactoring: improving code behind the scenes
We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactor...
Eli Tilevich, Yannis Smaragdakis
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
14 years 4 months ago
Congestion Aware Layout Driven Logic Synthesis
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
Thomas Kutzschebauch, Leon Stok
WCRE
2009
IEEE
14 years 2 months ago
The Logical Modularity of Programs
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
Daniel Ratiu, Radu Marinescu, Jan Jürjens
WCRE
2009
IEEE
14 years 2 months ago
Autumn Leaves: Curing the Window Plague in IDEs
—Navigating large software systems is difficult as the various artifacts are distributed in a huge space, while the relationships between different artifacts often remain hidden...
David Röthlisberger, Oscar Nierstrasz, St&eac...