Sciweavers

119 search results - page 5 / 24
» A New Method for Compiling Parallel Replacement Rules
Sort
View
CORR
2008
Springer
73views Education» more  CORR 2008»
13 years 10 months ago
Stiffness Analysis of 3-d.o.f. Overconstrained Translational Parallel Manipulators
The paper presents a new stiffness modelling method for overconstrained parallel manipulators, which is applied to 3-d.o.f. translational mechanisms. It is based on a multidimensio...
Anatoly Pashkevich, Damien Chablat, Philippe Wenge...
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 11 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
PLDI
2009
ACM
14 years 5 months ago
PetaBricks: a language and compiler for algorithmic choice
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
Jason Ansel, Cy P. Chan, Yee Lok Wong, Marek Olsze...
ACL
2012
12 years 1 months ago
Learning Better Rule Extraction with Translation Span Alignment
This paper presents an unsupervised approach to learning translation span alignments from parallel data that improves syntactic rule extraction by deleting spurious word alignment...
Jingbo Zhu, Tong Xiao, Chunliang Zhang
ENTCS
2007
108views more  ENTCS 2007»
13 years 10 months ago
Generating Java Compiler Optimizers Using Bidirectional CTL
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
Ling Fang, Masataka Sassa