Sciweavers

309 search results - page 24 / 62
» A Comparative Revisitation of Some Program Transformation Te...
Sort
View
PLDI
2000
ACM
13 years 12 months ago
Optimal instruction scheduling using integer programming
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
Kent D. Wilken, Jack Liu, Mark Heffernan
RECOMB
2009
Springer
14 years 2 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
TSP
2008
187views more  TSP 2008»
13 years 7 months ago
Invariant Description and Retrieval of Planar Shapes Using Radon Composite Features
This paper proposes a novel feature-based invariant descriptor termed Radon composite features (RCFs) for planar shapes. Instead of analyzing shapes directly in the spatial domain,...
Yun Wen Chen, Yan Qiu Chen
ECOOP
2005
Springer
14 years 1 months ago
Lightweight Defect Localization for Java
A common method to localize defects is to compare the coverage of passing and failing program runs: A method executed only in failing runs, for instance, is likely to point to the ...
Valentin Dallmeier, Christian Lindig, Andreas Zell...
INFOCOM
2011
IEEE
12 years 11 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang