search for: optmizes

Hi, I need some help with Portfolio Optimization problem. I am trying to find the minimum variance portfolio subjected to constraints on weights like /x1< w1 <x2 x3< w2 <x4</i> I need help with solving for the minimum variance portfolio as solve.QP doesn't allow me to specify the lower boundaries. Thanks Mahesh -- View this message in context:

...return TESTE(atoi(argv[1]),atoi(argv[2])); > } > > I don't know how gcc4 resolves the for loop, but the MSVC is great in this example. gcc-4.3 also eliminates the loop entirely and directly calculates the value of varx. > If I change the paraml and put a constant, the LLVM optmizes very well. It looks like LLVM's scalar evolution code isn't handling your testcase well. Ciao, Duncan.

Is there any reason to avoid looking at optimizing the encoding process? From just a simple profile run, it looks like a big chunk of the time is in seed_curve, sqrt, dradf4 and log. Are there big changes to the encoding part that are coming that would invalidate optimizations done now? -tim --- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage:

Before re-inventing the wheel I would like to ask: does anyone know about an optimizer in R which can reliably identify which value of X (Xopt) leads to Y (Yopt) closest to Ytarget in Y <- MonotoneStepFun(X) optionally with the restriction that Yopt <= Ytarget (at least if any Y <= Ytarget, otherwise any Yopt > Ytarget would be the preferred answer) If none is known, I will write

I was optimizing a 650MB using ferret (0.11.3) and I received the following error. I''ve seen some people have similar issues but I haven''t seen any resolutions. The contents of the index directory follow the error. Has anyone seen anything like this and found a resolution? Many thanks. /mnt/apps/search/releases/20070622175637/script/../config/../vendor/

Hello, I was trying to run few testcases and see how llvm optmizes different scenarios. I have a small testcase like: #include <stdio.h> int a, b, c; int main() { a = b + c; c = a; if (a == b) b = c; else b = a; printf( " a = %d \n ", a ); return 0; } The corresponding llvm IR is ( c...

Hello, 1) Is there any nonlinear programming optmizer that I can user for the following problem? Obj function: (max) revenue = price * volume Constraints: price and volume pair must be from the following variable data set: Variable data set: # price volume 1 10 500 2 20 450 3 30 330 4 40 250 5 50 190 Expected result: 10,000 (variable row#4) 2) Could it also be possible for the suggested

Hi all, Running simulations, I'm generating market response to 2 factors X&Y.. There is no closed form for the market response.. The results are store in a matrix Z(X <- seq(.02,.98,.02), Y <- seq(.01,.19,.01)).. For optmization purpose I need to approximate the values for any factor X in 0,02-0,98 and Y in 0,01-0,19 How can I do it ? For one factor : Xn-1 < x <= Xn

Hi all, I´ve been working on a transformation pass which performs the remotion of some redundant instructions. So now it´s finished I´d like to run the optimized programs generated by my pass. But I´ve got some problems to do this, because I didn´t find a way to generate assembly from the code and then call the gcc compiler to produce machine-dependent code. Please, does anybody know how to run

The following C code : #include <stdio.h> #include <stdlib.h> int TESTE2( int parami , int paraml ,double paramd ) { int varx=0,vary; int nI =0; //varx= parami; if( parami > 0 ) { varx = parami; vary = varx + 1; } else { varx = vary + 1; vary = paraml; } varx = varx + parami + paraml; for( nI = 1 ; nI <= paraml; nI++) { varx =

Hi I''m using wondershaper like script. But noticed imperfect scheduling. By googling, I found some patches that takes the aal5 atm overhead in the scheduling algorithms. http://www.adsl-optimizer.dk/ADSL-optimizer/ Before trying it, has anyone tried these patches? they apply on 2.4.29 kernel and 2.6.9 TC. I use centos4 with a 2.6 kernel, so I can''t try these easily. Thanks

Thank you for the answer Reid. I've been already using the format `opt -load MyPass.so -my-pass input.bc -o output.bc`. But my problem is to execute the .s generated file. As long as I know, gcc compiler is capable to generate target machine code from assembly. So I tried to compile it with gcc to generate machine code, but there was many problems. Is there any way to compile and run .s files?

Hello. I'm new to LLVM and I've got some problems with LLVM JIT. I have set ExecutionEngine as CodeGenOpt::Aggressive and PassManagerBuilder.OptLevel as 3. (mem2reg and GVN are included) However, the machine code generated by JIT is not as good as that generated by clang or llc. Here is an example: -------------------------------------------------------------------- source fragment

Hi, the following llvm-ir is manipulated by the optimizers: %target2 = getelementptr %.string %result, i32 0, i32 3, i32 %len1 (%_.string = type {i32, i32, i32, [0 x i8]}) the last parameter i32 %len1 is replaced by i32 0 by the optimizers. (both, 2.9 and 2.8). When i turn optmization off, it works correctly. How can i use an optimizer-safe dynamic indexing of arrays? -------------- next part

Hello R experts! I'm running a FOR loop in which at every step an arima model is generated. The problem is some series produces numeric problems with optim. My question is if there is a way of telling to R that at every critical error of optim jumps to the next series instead of stopping the calculations. Or better yet, tell it to run another arima fit but with a different optmization

HI, Dear R community, I want to know how to select the optimal decision threshold from the ROC curve? At what threshold will give the highest accuracy? Thanks! -- Sincerely, Changbin -- [[alternative HTML version deleted]]

Since a, b, and c are globals, how does the optimize *know* they are not used elsewhere (e.g. another module)? On Fri, Jan 4, 2013 at 7:49 AM, Somenath Chakraborty <some.chak at gmail.com>wrote: > Hello, > > I was trying to run few testcases and see how llvm optmizes different > scenarios. I have a small testcase like: > > > #include <stdio.h> > > > > int a, b, c; > > > > int > > main() > > { > > a = b + c; > > c = a; > > > > if (a == b) > > b = c; > >...

Hi all, A few different though somewhat related questions here. I'm really grateful for your answers! 1. From a previous question I know that sizeof's are resolved into literals early in the front-end before IR is even emitted. It seems that they are resolved into whatever value is correct for the host machine. But if one wishes to then take the IR and emit assembly code for some other

The following C test program was compiled using LLVM with -O3 option and MSVC with /O2. The MSVC one is about 600 times faster than the one compiled with the LLVM. We can see that the for loop in MSVC assembler is solved in the optimization pass more efficiently than that in LLVM. Is there an way to get a optimization result in LLVM like that of the MSVC? Manoel Teixeira #include

How are you getting LLVM to run your pass? There's plenty of information here if you haven't found this document: http://llvm.org/docs/WritingAnLLVMPass.html I'm going to assume you're using `opt -load MyPass.so -my-pass input.bc -o output.bc` in which case you can just run llc on output.bc to get a .s file. Reid On Thu, Jul 1, 2010 at 8:16 PM, Alysson <aishofpf at