search for: intractable

...have any real answers. so it's a good thing nobody expects any answers from jim. *** on the other hand, people _do_ expect (or at least _hope_) that greg will have some real answers. alas, it seems not... this latest "solution" won't work, because it doesn't address the intractable nature of the problem that underlies all this. let's use #76 to focus our thinking. what we need to do to have any "success" here is to actively discourage users from downloading #76 for _any_ reason... ideally, we would like to drive its download-count to _zero_. (in a perfect wo...

Hello, I'm using the "glmulti" package to run models of all the possible combinations of my variables. However, I am only interested in a few interactions between them. I have tried the equivalent of: 1) mod1<-lm(y~a+b+c+a:b) glmulti(mod1, level=1) 2) mod2<-lm(y~a+b+c+a:b) glmulti(mod2, level=2) 3) glmulti("y", c("a",

Hello, I'm using the "glmulti" package to run models of all the possible combinations of my variables. However, I am only interested in a few interactions between my variables. I have tried the equivalent of: mod1<-lm(y~a+b+c+a:b) glmulti(mod1, level=1) mod2<-lm(y~a+b+c+a:b) glmulti(mod2, level=2) and glmulti("y", c("a", "b", "c"),

Hello: This browsing problem is not going away. We have followed the how-to, used someone else's "known good" config, perused packet dumps until we were blue, and tried replicating the setup in a laboratory environment to see if it was site-specific. The problem is still there: If the Samba server is the domain browser, the Network Neighborhood (or My Network Places) for the

...with two questions. First, the inability to convert encrypted commercial keys into similarly encrypted OpenSSH keys is unfortunate. Can anyone give me the standard story on why this doesn't work as one might hope? Is it simply a feature that is waiting to be implemented, or are there deeper intractable issues? Second, there is one conversion path missing. How does one convert an OpenSSH private key into a commercial private key? Thank you!

...ved problem. I.e., it's hard for the MergeFunctions pass to be *really sure* that two functions are a) really identical and b) safe to merge. Is there a systematic solution at the IR-level, given that the semantics of IR are subject to change? Is extensive testing the only solution? Or is this intractable, and the only safe approach is to perform merging post-regalloc (or, at some late point when equivalence is easier to determine)? thanks, vedant -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20190131/95fdd9...

Hi, I am new in R.I am trying to analysis of variance for Randomized-complete blocks design. I have 4 treatments and 3 replication, Without intraction.then .I is going to use LSD test or Duncan test for comparison between average values of treatments. I want to know, is there any significant change between treatment and between weeks? Because I did experiment for 8 weeks. I am not

...CANNOT] Renaming not supported across non-private namespaces. I guess this is because renaming a subfolder could potentially break subscriptions for other users? Or is it a hard requirement from IMAP RFC? If the former, is the problem merely very complicated, but eventually fixable, or is it just intractable? We're using Dovecot 2.0.7 from the atrpms RPM, Redhat EL 5.0. The public mailbox namespace is configured with: namespace { type = public prefix = Public/ separator = / hidden = no list = yes inbox = no subscriptions = no location = maildir:/data/imapmail/public:LAYOUT=fs } -...

...ose who responded to my inquiry about generalized linear mixed models on R and S-plus. Before I summarize the software, I note that there are several ways of doing statistical inference for generalized linear mixed models: (1)Standard maximum likelihood estimation, computationally intensive due to intractable likelihood function (2) Penalized quasi likelihood or similar approximations (Breslow & Clayton, 1993; Lee & Nelder, 1999, Schall 1991). This method is not good for binomial outcomes in particular. Theoretically, it is consistent when the cluster size increases. It is not consistent when t...

I found a book on this (http://www.amazon.com/Automatic-Algorithm- Recognition-Replacement-Optimization/dp/0262133687) on Amazon. Last I heard this was considered an intractable problem in the general case... but ad hoc solutions for specific functions (like memcpy) are possible. That book looks fairly promising. On Aug 7, 2007, at 10:32 AM, Nikhil A. Patil wrote: > Hi, > > This is really more a general compiler question, not so specific to > LLVM. >...

Hi, This is really more a general compiler question, not so specific to LLVM. Given a set of pre-defined "primitive" functions, is there a way to un-inline function calls out of a function? (This is different from "extracting" functions because you are not allowed to create a new function, but only to use existing functions in the pool. These "primitive" functions

...know that way is infeasible. Thanks again. 2011/5/5 Joshua Warner <joshuawarner32 at gmail.com> > Wen-Han, > > It sounds like there are two problems here: first is detecting when free is > not properly called, and figuring out where to insert the call - which seems > like an intractable problem by iteself. Second is a reversible translation > from C to LLVM IR. LLVM does (did?) have support for generating C code > again on the back end, but the result doesn't look that much like the > original code. In order to translate changes from the IR back to the source >...

...c in the limit with k -> 0. This causes a problem because the Kappa function has a term raised to (1/k)th power leading the numerical singularlity for low values of k. (Since the logistic function gave a good fit, then I am sure that best fit value for k is very small.) If so, this problem would intractable, but I thought I see what response I got from other users before giving up on this track. Here are a few lines from the command line: > funct3 function(x, h, k, z, a) { (1 - h*(1 - k*(x - z)/a)^(1/k))^(1/h) } > reg24 <-nls(FldFatRate ~ funct3(MeanDepth_m, h,k,z,a), data=data1, + start=l...

...y fine with the correct group sizes: >Number of Observations: 246 >Number of Groups: > TEST PLANT %in% TEST > 41 123 I couldn't find this error mentioned in any other posts on the list. Can someone enlighten me as to how to get around this intractable problem? My crude solution is to go around the obstacle by computing the mean of each plant pair and using a GLM with poisson distribution and ignore random effects. Martin ************************************************************************ Martin Henery Post doctoral researcher Dépa...

Pardon me if I don't adhere to list protocol - this is my first post: I have a simple home network with a seemingly intractable problem. I'm pretty new to Samba, though, and I can't help but think the answer, like the purloined letter in Edgar Allan Poe's story, is staring me in the face. Various folks have been helping me over on the Fedora list for 9 days, now, so I thought I'd try this problem here....

...model of the LLVM IR to be *parameterized*. In one mode, an instruction would produce undefined behavior on division, and in another mode it would produce a trap. Then you are asking for the optimizer stack to support either semantic model, and produce efficient code regardless. This is completely intractable for LLVM to support. It would make both the optimizers and the developers of LLVM crazy to have deep parameterization of the fundamental semantic model for integer division. The correct way to support *exactly* reproducing the architectural peculiarities of the x86-64 integer divide instruction is...

...ved problem. I.e., it's hard for the MergeFunctions pass to be *really sure* that two functions are a) really identical and b) safe to merge. Is there a systematic solution at the IR-level, given that the semantics of IR are subject to change? Is extensive testing the only solution? Or is this intractable, and the only safe approach is to perform merging post-regalloc (or, at some late point when equivalence is easier to determine)? In Rust we've been running with MergeFunctions enabled by default for a while now, and have recently also enabled the use of aliases instead of thunks. Apart from s...

Pardon me if I don't adhere to list protocol - this is my first post: I have a simple home network with a seemingly intractable problem. I'm pretty new to Samba, though, and I can't help but think the answer, like the purloined letter in Edgar Allan Poe's story, is staring me in the face. Various folks have been helping me over on the Fedora list for 9 days, now, so I thought I'd try this problem here....

On 13 November 2016 at 00:13, Kirill M?ller wrote: | On 13.11.2016 00:00, Dirk Eddelbuettel wrote: | > On 12 November 2016 at 22:54, Kirill M?ller wrote: | > | > [... lots of stuff deleted ...] | > | > | I noticed this because plogr logging crashed in dplyr (compiled with gcc | > | 6) right after upgrading to yakkety; I still had a gcc-5 built version | > | of Rcpp installed.

Hey again, Thank you for your opinions. I will take them into consideration. A few comments... On Sun, Apr 7, 2013 at 1:39 PM, Jeffrey Yasskin <jyasskin at google.com> wrote: ... > If the performance penalty is unclear to you, that means you haven't > measured it. Until you measure, you have absolutely no business > complaining about a potential performance problem. Measure,