search for: sequenceb

...oblem with the g variabel. In the example they type g <- factor(c(rep("A", 7), rep("B", 8))) I cannot find any information about what this c(rep....) does. Do anyone know about a proper manual for the amova function? My input file for g looks like this: sequenceA 1 sequenceB 1 sequenceC 1 . . . . sequenceD 5 . . sequenceE 9 sequenceF 9 Where sequenceA is in group 1, sequenceD is in group 5 and so on... If I type is.factor(g) I get FALSE I have also checked that the d (a matrix file) is a numeric file. It should be correct. is.numeric(d) TRUE...

...itially not so useful, transform any operand A into an add with A plus 0. Later, this is important to prove we can use an add instruction to load any operand. Well, I think you got the idea of using a set of axioms... this, in practice, is important to prove an arbitrary sequence A is equivalent to SequenceB, and, if B is shorter than A, use B instead. Speaking of implementation, there will be a big list of transformations and a "for" loop trying each transformation and recursively applying more transformations, until we can show a code sequence is equivalent to another. This is a short over...

...l, transform any operand A into > an add with A plus 0. Later, this is important to prove we can use an add > instruction to load any operand. Well, I think you got the idea of using a set > of axioms... this, in practice, is important to prove an arbitrary sequence A is > equivalent to SequenceB, and, if B is shorter than A, use B instead. Speaking > of implementation, there will be a big list of transformations and a "for" loop > trying each transformation and recursively applying more transformations, until > we can show a code sequence is equivalent to another. This...

...l, transform any operand A > into an add with A plus 0. Later, this is important to prove we can use an > add instruction to load any operand. Well, I think you got the idea of using > a set of axioms... this, in practice, is important to prove an arbitrary > sequence A is equivalent to SequenceB, and, if B is shorter than A, use B > instead.  Speaking of implementation, there will be a big list of > transformations and a "for" loop trying each transformation and recursively > applying more transformations, until we can show a code sequence is > equivalent to another....

Hello, I want to present my project for GSoC 2011 for LLVM below. It would be very nice to hear suggestions and your opinion, thanks! Superoptimization for LLVM IR Objective This project focuses on implementing superoptimization algorithms targeted at the LLVM IR. The project uses arbitrary LLVM bitcode as a training set to discover new peephole optimizations that can be later integrated into