search for: infeasible

...derstand, the current analyzer traces the program, and at each branch, it branches out into the true branch and the false branch. The true and false branch causes certain constraints on the values. If the conditions on the branch causes a constraint to be unsatisfiable, the path is considered to be infeasible. traces the program, and at each branch, it branches out into the true branch and the false branch. The true and false branch causes certain constraints on the values. If the conditions on the branch causes a constraint to be unsatisfiable, the path is considered to be infeasible. In that case, z3...

so I have some local users that I'd like to show up in my samba domain a bit more properly, but it's infeasable to add their accounts to the ldap directory proper. I've tried to create an idmap entry (probably wrong) and a structural SID with a sam account pointing to the numeric UID and a proper name for the unix account, but it still shows up as UNIX-USER/accountname. what am

...o longer working here and no longer willing to assist. I found an interesting 3-day course offered by this one company, but they turned out to be in London, and it'll be tough enough to get them to transport and pay for this course in a local area, trying to get them to fly me out of the U.S is infeasible. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.digium.com/pipermail/asterisk-users/attachments/20041210/033d027a/attachment.htm

Hi, There are numerous emails flying around the list at the moment regarding the state of the JIT. In its current state it is infeasible to add support for another architecture (very difficult to say the least) - there are plans currently being formulated to deal with this and convert the JIT to the new MC architecture, which would allow much easier porting between platforms. Have a look for the subject "[LLVMdev] MC-JIT Desig...

...f non-inferiority tests. The first would be a log-rank test and the second would be a Wilcoxon rank-sum test. I want to be able to determine the sample size that would be necessary to test for a 3 day difference in median recovery time between 2 groups of cancer patients.   Both of these tests are infeasible using SAS Proc Power and I haven't been able to find information about how to do them using either SAS or R.   Does anyone know how to perform either of these calculations? If so, I'd greatly appreciate it if you could share a couple of examples.     Thanks,   Paul [[alternative HTML ver...

...9; -- to see them. I've found 'str' extremely valuable for understanding and explaining to others the internal structure of an R object. In many cases, it has helped me find fairly simple ways to do things with R objects that might have been much more difficult and perhaps infeasible without 'str' -- and without access to the right expert, who may not be available in the time I have to solve a particular problem. Thanks again to Martin Maechler, who wrote 'str', and to everyone else who has replied to questions from me over the years. Best Wis...

On Wed, Nov 17, 2010 at 12:11 AM, Bruno Cardoso Lopes <bruno.cardoso at gmail.com> wrote: > Hi, > > On Sun, Nov 14, 2010 at 5:39 AM, Michael.Kang <blackfin.kang at gmail.com> wrote: >> I like to get the support of llvm runtime so that I can run some VM >> that depends on llvm. I googled porting keyword >> and also simply try to cross compile llvm. Just like

OK. Thank you. What I want to do is: Fix source code in-place, then feed it to compiler normally. I assume I can fix source code in-place using clang::SourceManager, but I cannot find the appropriate API. Now I 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 ites...

...ough: the primary platform I care about is planning to be off of libstdc++4.9 (the tall poll of the tent for us) by the end of 2018. So it seems like right after the branch in January 2019 would be fine for us to bump things up. Anything earlier than this will be somewhere between extremely hard to infeasible for us. At that point, we could probably go for C++17 as easily as C++14. But maybe my group is unique in that timing so we should really ask others for input as well. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/atta...

Hi My goal is that given a binary and the corresponding input. I want to know what IR level basic blocks are covered. I need the detail information, which is the set of all the covered BBs rather than just a number. I want to know whether there are some tools that can support this requirements. If not, I think maybe instrumentation can helps. However, I do not know too much about this. Any

On Wed, Nov 17, 2010 at 4:30 PM, James Molloy <James.Molloy at arm.com> wrote: > Hi, > > There are numerous emails flying around the list at the moment regarding the state of the JIT. In its current state it is infeasible to add support for another architecture (very difficult to say the least) - there are plans currently being formulated to deal with this and convert the JIT to the new MC architecture, which would allow much easier porting between platforms. > > Have a look for the subject "[LLVMdev] MC-...

...t; d3 [1] 0.4 -0.2 0.1 1.0 0.0 0.0 0.0 > N3 [1] 1 1 3 1 1 1 1 > fit <- socp(f, A3, b3, C3, d3, N3) Error in .socp.phase1(f, A, b, N, control) : Phase 1 failed, alpha>=0 I'm having trouble interpreting this error message. It seems to me that the problem is the initial point is infeasible, but I may be wrong here. If I am right, I'm not sure why it is infeasible given that I have only added a few simple conditions. Any thoughts? Thanks a bunch, Ryan -------------------------------------------------------------------------- Please open the following attachment for important...

.... Say, we have c <- c(1,4,3,2) csort <- sort(c,descreasing=FALSE) With a few components of c, we can manually find out: csort[1] = 1 = c[1], ie, the original index of csort[1] is 1, csort[2] =2 =c[4], ie, the original index of csort[2] is 4. When length(c) is very large, manual checking is infeasible. We can set up a for loop to compare and extract the index. However, is there an easier way to do this, so that the output is the sorted vector and their corresponding original indices. Thanks Chee [[alternative HTML version deleted]]

...and the problematic part: the minimum weights level for each asset is +0,01 OR zero (in order to control outcome portfolio size) à Initially, considering that the minimum weight constraint is +0,01 for each of the 1.500 assets and the sum of weights constraint (leverage) equals 1 would raise an infeasible problem for the optimizer. Given my additional restriction that the minimum weight for any asset to get into the portfolio should be at least 0,01 would solve the target conflict in between minimum asset weights and the leverage of 1. The iteration path of the optimizer should consider something li...

...different) executions for the same source and inputs. Running with -fsanitize=undefined will detect problems just on the executions that the current compiler implementation happens to generate. Of course, checking against all allowed executions of a very loose spec quickly becomes combinatorially infeasible, so this isn't unreasonable, but at lease we'd like to have that gold standard precisely defined, and to be able to pseudorandomly check against it. thanks, Peter > http://clang.llvm.org/docs/UsersManual.html#controlling-code-generation > >> so that basic development techni...

...is below. Thank you for your time. >x = array(0, dim=c(4,4)) > fix(x) > x col1 col2 col3 col4 [1,] 0 1 2 3 [2,] 1 0 11 5 [3,] 2 4 0 6 [4,] 3 5 6 0 > library(TSP) > example = ATSP(x) > example2 = reformulate_ATSP_as_TSP(example, infeasible = 1000, cheap = > .0001) Error in dimnames(tsp) <- list(lab, lab) : length of 'dimnames' [1] not equal to array extent -- View this message in context: http://r.789695.n4.nabble.com/ATSP-to-TSP-reformulation-tp3755143p3755143.html Sent from the R help mailing list archive at Nabbl...

On Nov 17, 2010, at 12:37 AM, Michael.Kang wrote: > On Wed, Nov 17, 2010 at 4:30 PM, James Molloy <James.Molloy at arm.com> wrote: >> Hi, >> >> There are numerous emails flying around the list at the moment regarding the state of the JIT. In its current state it is infeasible to add support for another architecture (very difficult to say the least) - there are plans currently being formulated to deal with this and convert the JIT to the new MC architecture, which would allow much easier porting between platforms. >> >> Have a look for the subject "[LLV...

...while all of my systems are visible to everyone on the network, the browse lists for the rest of the network are still limited to whatever subnet the client machine is on. At this point it looks as though I would have to set up a domain controller for each of the 20+ workgroups. Of course this is infeasible. Am I missing something? A few machines are set up to use and proxy WINS, one of my systems is acting as the WINS server, this has had no noticeable effect on the network. Just to make things interesting, my network consists of just about every version of Windows since 95, MacOS from version 7...

...from all three vectors such that the combination of the three elements in each draw is not the same as any previous draws. I could use expand.grid to generate a vector out of the three vectors. But when the number of vectors are large and the number of elements in some vectors are large, it will be infeasible to do so. If you know there is a method on sampling on more than one variables, would you please let me know? Thank you! -- Tom

...ervations of 20,000 factors. I.e., each factor has 20 observations. y is 800,000 normally distributed data points. I want to see how much R^2 the X factors can provide. Easy, right? > lm ( y ~ X) and > aov( y ~ X) Error: cannot allocate vector of size 3125000 Kb is this computationally infeasible? (I am not an expert, but off-hand, I thought this can work as long as the X's are just factors = fitted means.) > help.search("fixed.effects"); fixed.effects(nlme) Extract Fixed Effects fixed.effects.lmList(nlme) Extract lmList Fixed Effects lme(nlme)...