search for: 6_12

Displaying 4 results from an estimated 4 matches for "6_12".

Did you mean: 612
2013 Aug 06
1
[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation
...to loops - you would instead want to sink it below code that guards the loop, but not actually into the loop. Here is one paper I am aware of that appears to have an SSA-based formulation of PDE. I have not read this as it is behind a paywall: http://rd.springer.com/chapter/10.1007%2F3-540-48294-6_12 Mark
2013 Aug 06
0
[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation
...> want to sink it below code that guards the loop, but not actually into the > loop. > > Here is one paper I am aware of that appears to have an SSA-based > formulation of PDE. I have not read this as it is behind a paywall: > http://rd.springer.com/chapter/10.1007%2F3-540-48294-6_12 > > Mark > > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130806/844869f2/attachment.html>
2013 Aug 06
3
[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation
All, I have some code that looks like the following: { double a, b, c; for (...) { ... a = lots of FP math; b = lots of FP math; c = lots of FP math; if (cond) { a = 0.0; b = 0.1; c = 0.2; } ... } } Could we not convert the hammock into a diamond and move the initial computation of a, b, and c into the else block. Something like this: {
2012 Mar 09
1
Multiple Correspondence Analysis
You should send this to r-help@stat.math.ethz.ch. On 03/09/2012 09:21 AM, Andrea Sica wrote: > Hello everybody, I'm looking for someone who is able with MCA and > would like to gives some help. > > If what I'm doing is not wrong, according to the purpose I have, I > need to understand how to create a dependence matrix, where I can > analyze the > dependence between