Sciweavers

4036 search results - page 653 / 808
» Formal Methods
Sort
View
POPL
1995
ACM
15 years 10 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
ICDCS
2010
IEEE
15 years 8 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
BMCBI
2008
138views more  BMCBI 2008»
15 years 6 months ago
M-BISON: Microarray-based integration of data sources using networks
Background: The accurate detection of differentially expressed (DE) genes has become a central task in microarray analysis. Unfortunately, the noise level and experimental variabi...
Bernie J. Daigle Jr., Russ B. Altman
ENTCS
2007
168views more  ENTCS 2007»
15 years 6 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
BMCBI
2011
15 years 1 months ago
DoBo: Protein domain boundary prediction by integrating evolutionary signals and machine learning
Background: Accurate identification of protein domain boundaries is useful for protein structure determination and prediction. However, predicting protein domain boundaries from a...
Jesse Eickholt, Xin Deng, Jianlin Cheng