Sciweavers

11740 search results - page 123 / 2348
» More Problems in Rewriting
Sort
View
108
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 26 days ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
102
Voted
TIT
2010
111views Education» more  TIT 2010»
14 years 7 months ago
Designing floating codes for expected performance
Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, ...
Flavio Chierichetti, Hilary Finucane, Zhenming Liu...
108
Voted
BMCBI
2008
125views more  BMCBI 2008»
15 years 27 days ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
SIAMSC
2011
151views more  SIAMSC 2011»
14 years 7 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li
ERSHOV
2009
Springer
15 years 4 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...