Sciweavers

4725 search results - page 731 / 945
» Dependence-Based Program Analysis
Sort
View
202
Voted
COCOON
2010
Springer
15 years 3 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
SCP
2010
108views more  SCP 2010»
15 years 3 months ago
Combining dynamic and static slicing for analysing assembler
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
Martin P. Ward, Hussein Zedan
162
Voted
SPIN
2010
Springer
15 years 3 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
TMC
2010
139views more  TMC 2010»
15 years 3 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
146
Voted
TON
2010
119views more  TON 2010»
15 years 3 months ago
Thwarting zero-day polymorphic worms with network-level length-based signature generation
—It is crucial to detect zero-day polymorphic worms and to generate signatures at network gateways or honeynets so that we can prevent worms from propagating at their early phase...
Lanjia Wang, Zhichun Li, Yan Chen, Zhi Fu, Xing Li