similar to: [LLVMdev] Passing parameters to LLVM optimisation passes

> C requires that (void*)0 generates a pointer that does not compare equal to any valid pointer. It does not require that (void*)foo, where foo is an int of value 0 but not an integer constant expression, give the same value, Does this mean constant propagation can change program semantics? -- Sanjoy

OS: CentOS 5.0 x86. Hi, I am using CentOS 5.0 at home, ADSL ~16 Mbps/~1 Mbps Internet connection and my ping time to my ISP is 160-170 msec. When downloading something with Firefox, I am getting download speeds of about 100-180 KB/sec (for example when downloading SP2 of XP from MS server). Are the CentOS networking settings OK for this kind of latency, or do I have to change some settings?

Can optimisation (simplex etc) be done through R?

Hi, I'm trying to do some constrained non-linear optimisation, but my function does not have second order derivatives everywhere. To be a little more specific (the actual function is huge and horrible, so it would probably be better to just describe it) my model has four variables and I'm using optim to minimise an error term. My data is split into discreet days and I have two types of

Hello. I have searched the archives but have not found anything. I need to solve a constrained optimisation problem for a nonlinear function (“maximum entropy formalism”). Specifically, Optimise: -1*SUM(p_ilog(p_i)) for a vector p_i of probabilities, conditional on a series of constraints of the form: SUM(T_i*p_i)=k_i for given values of T_i and k_i (these are constraints on

Have a look at ?optim. I don't think it has the BHHH algorithm as an option, though. =========================================== David Barron Jesus College University of Oxford -----Original Message----- From: r-help-bounces at stat.math.ethz.ch [mailto:r-help-bounces at stat.math.ethz.ch]On Behalf Of Harold Doran Sent: 10 July 2003 15:43 To: Fohr, Marc [AM]; R-help at stat.math.ethz.ch

Hello, I have a problem. I am using the NLME library to fit a non-linear model. There is a linear component to the model that has a couple parameter values that can only be positive (the coefficients are embedded in a sqrt). When I try and fit the model to data the search algorithm tries to see if a negative value for one of these parameter values will produce an optimal fit. When it does

I'd like to write a function that has a vector and a (pos.) number as inputs and returns what is on the picture below (arithmetic means of (k) consecutive elements of a given vector). The problem is it works too slow for long vectors and i know it can be done without "for" loop. However, i've got no idea how. Can anyone help me with that? f1 <- function(v,k) { n <-

Dear list, this is not a particular R question but perhaps someone can help. I am running a maximum likelihood estimation (competing risk duration model with unobserved heterogeneity) on 30 different datasets. The problem is that on 2 datasets the model does not converge. I am interested if there are any methods, based on the gradients or (an approximation of) the hessian which helps to

Hi, I believe that Caret uses a ?grid-serach approach. I was wondering if: 1 There are more efficient implementations for HP tuning for classification algos?(eg XGboost, CatBoost, SVM, RF etc),?using say?GM/SWARM approaches, akin to Google's approach AutoML for Image related Net problems? 2 This one is most probably wishful thinking, but is anyone looking at GM/SWARM at HP tuning across models

I've been recompiling syslinux 2.09 and with my gcc 3.3.2, I must use the -O1 option instead of -Os. After compiling with -Os, the linker says "undefined reference to `memcmp'" My gcc specialist told me that this error was due to a too long inline of memcmp(). I've tryied my memdisk compiled in O1, the size is really quite the same and it works fine. So I will keep memdisk

Hello Sir/Ma?am I beg to state that I was looking for a project In GSOC 2016 which matches my skill and passion, and I came across Matcher Optimisation, Xapian. This project has really captured my interest and I would love to contribute to this project. I am a computer engineering undergraduate so I am good at programming languages (especially C and C++), algorithms, logical and analytical

I came across the LLVM demo (http://llvm.cs.uiuc.edu/demo/index.cgi) today. It seems to mis-optimise my test case, calculating the wrong value. I'm not a LLVM user so it's not a problem for me; just thought I'd send it your way in case this is a bug. The following code should return the value 17 (I tested with GCC, to be sure): int main() { int i; for (i=0; i<10; i++)

Hi, The back end of our functional compiler often generates sequential switch statements in LLVM typed assembly that scrutinize on the same expression. For example, in C syntax: #1 switch( e ) { case e2: { e3 } ... } switch( e ) { case e2: { e4 } ... } In this case, it would be nice if the second switch would be embedded in each arm of the first switch. Because the set

On Monday 04 January 2010 01:12:55 Simon Harris wrote: > I'm investigating "improving" the TCO facilities in LLVM to provide for > "hard" tail calls. Specifically, this would involve extending the existing > implementation to discard the stack frame for the caller before executing > the callee. I would then like to extend this further by performing hard >

On Monday 04 January 2010 03:33:06 Simon Harris wrote: > On 04/01/2010, at 3:01 PM, Jon Harrop wrote: > > I am certainly interested in tail calls because my HLVM project relies > > upon LLVM's tail call elimination. However, I do not understand what tail > > calls LLVM is not currently eliminating that you plan to eliminate? > > Mutual recursion for a start: >

Hello, I followed the instruction given at: http://llvm.org/docs/LinkTimeOptimization.html#design, but got an error. Why it was that? Should I enable anything when configuring LLVM? I am using LLVM v2.6. $ llvm-gcc --emit-llvm -c a.c -o a.o $ llvm-gcc -c main.c -o main.o $ llvm-gcc a.o main.o -o main a.o: file not recognized: File format not recognized collect2: ld returned 1 exit status

Hello, I want to reduce the bandwidth taken by an IAX trunk when used with a small number of voice channels. When only one call is passed through an IAX trunk, the IP overhead is indecent. I would like to increase the IAX voice packet emission interval (20ms - i'm using speex) to something much larger, in order for the packets to transport as much data as possible. I've been

Commit-ID: c5667560c8ffc917b99ccaa77898a998cbe4d72b Gitweb: http://git.kernel.org/?p=libs/klibc/klibc.git;a=commit;h=c5667560c8ffc917b99ccaa77898a998cbe4d72b Author: Herbert Xu <herbert at gondor.apana.org.au> AuthorDate: Fri, 26 Sep 2014 16:47:25 +0800 Committer: Ben Hutchings <ben at decadent.org.uk> CommitDate: Fri, 25 Jan 2019 02:57:21 +0000 [klibc] [BUILTIN] Small

Commit-ID: 966eb99fcbe60e5dc65ca75a9db95ccffcd086ac Gitweb: http://git.kernel.org/?p=libs/klibc/klibc.git;a=commit;h=966eb99fcbe60e5dc65ca75a9db95ccffcd086ac Author: Herbert Xu <herbert at gondor.apana.org.au> AuthorDate: Fri, 26 Sep 2014 16:47:25 +0800 Committer: Ben Hutchings <ben at decadent.org.uk> CommitDate: Sat, 28 Mar 2020 21:42:54 +0000 [klibc] dash: [BUILTIN] Small