Sciweavers

915 search results - page 30 / 183
» Maximally Abstract Retrenchments
Sort
View
ICSE
2012
IEEE-ACM
11 years 10 months ago
Axis: Automatically fixing atomicity violations through solving control constraints
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
Peng Liu, Charles Zhang
AI
2009
Springer
14 years 2 months ago
Exploratory Analysis of Co-Change Graphs for Code Refactoring
Abstract. Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS ha...
Hassan Khosravi, Recep Colak
ICC
2008
IEEE
119views Communications» more  ICC 2008»
14 years 2 months ago
Capacity Analysis and Power Allocation over Non-Identical MISO Rayleigh Fading Channels
Abstract— We analyze the capacity of a multiple-input singleoutput system over Rayleigh fading channels. The channels are assumed to be independent and non-identically distribute...
Le Cao, Meixia Tao, Pooi Yuen Kam
ML
2006
ACM
122views Machine Learning» more  ML 2006»
14 years 1 months ago
Type-safe modular hash-consing
Hash-consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamenta...
Jean-Christophe Filliâtre, Sylvain Conchon
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
14 years 1 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle