Home
last modified time | relevance | path

Searched refs:nruns (Results 1 – 25 of 384) sorted by relevance

12345678910>>...16

/dports/math/SCIP/scip-7.0.3/check/
H A Daverage.awk94 type[nruns,nprobs[nruns]] = $2;
97 conss[nruns,nprobs[nruns]] = $5;
98 vars[nruns,nprobs[nruns]] = $6;
101 gap[nruns,nprobs[nruns]] = $9;
102 iters[nruns,nprobs[nruns]] = $10;
113 type[nruns,nprobs[nruns]] = $2;
116 conss[nruns,nprobs[nruns]] = $5;
117 vars[nruns,nprobs[nruns]] = $6;
120 gap[nruns,nprobs[nruns]] = $9;
121 iters[nruns,nprobs[nruns]] = $10;
[all …]
H A Dpermaverage.awk127 name[nruns,nprobs[nruns]] = $1;
128 type[nruns,nprobs[nruns]] = $2;
129 origconss[nruns,nprobs[nruns]] = $3;
130 origvars[nruns,nprobs[nruns]] = $4;
131 conss[nruns,nprobs[nruns]] = $5;
132 vars[nruns,nprobs[nruns]] = $6;
135 gap[nruns,nprobs[nruns]] = $9;
136 iters[nruns,nprobs[nruns]] = $10;
139 status[nruns,nprobs[nruns]] = $13;
148 …if ( status[nruns,nprobs[nruns]] == "sollimit" || status[nruns,nprobs[nruns]] == "gaplimit" || sta…
[all …]
/dports/math/R-cran-FrF2/FrF2/R/
H A Dpb.R44 pb <- function (nruns, nfactors = nruns - 1, factor.names = if (nfactors <= argument
74 if (nruns == 8) {
203 if ((nruns %in% c(52, 76) & !oldver) | nruns==100)
204 sel <- sel[,c((1:(nruns%/%2-1))*2+1,(1:(nruns%/%2-1))*2,1)]
221 1):(i * nruns)] <- sample(nruns)
253 attr(aus, "design.info") <- list(type = "pb", nruns = nruns, nameattr
261 if (nfactors == nruns-1 & nruns %in% c(40,56,64,88,96) & !oldver){
267 if (nfactors == nruns-1 & nruns %in% c(52,76,100) & !oldver){
273 if (nfactors-n.error > nruns%/%2 & nruns %in% c(40,56,64,88,96) & oldver)
281 if (nruns==12)
[all …]
H A DFrF2.R55 if (!is.null(nruns)) if (ncenter>0) if (center.distribute > nruns + 1)
118 if (!is.null(nruns)) {if (!nruns==cand[[1]]$nruns)
120 else nruns <- cand[[1]]$nruns
131 if (!is.null(nruns)){
157 if (!isTRUE(all.equal(log2(nruns) %% 1,0))) nruns <- 2^(floor(log2(nruns))+1)
235 cand <- list(custom=list(res=res, nfac=nfactors, nruns=nruns, nameattr
310 if (hard>=nruns/2 | WPs==nruns) {
355 if (!is.null(nruns)){
382 cand <- list(custom=list(res=Inf, nfac=nfactors, nruns=nruns, nameattr
606 if (is.null(nruns)) {nruns <- cand[[1]]$nruns
[all …]
H A DFrF2Large.R17 FrF2MA <- min(fiveFrF2MA$nruns[which(fiveFrF2MA$nfactors >= nfactors)])
18 FrF2 <- min(fiveFrF2$nruns[which(fiveFrF2$nfactors >= nfactors)])
28 FrF2Large <- function(nruns, nfactors=NULL, argument
54 k <- round(log2(nruns))
55 if (!2^k==nruns) stop("nruns must be a power of 2.")
69 if (ncenter>0) if (center.distribute > nruns + 1)
169 cand <- list(custom=list(res=res, nfac=nfactors, nruns=nruns, nameattr
176 rownames(desmat) <- 1:nruns
178 rand.ord <- rep(1:nruns,replications)
181 rand.ord[((i-1)*nruns+1):(i*nruns)] <- sample(nruns)
[all …]
H A Dprint.catlg.R1 print.catlg <- function(x, name="all", nruns="all", nfactors="all", argument
4 if (name[1]=="all" & nruns[1]=="all" & nfactors[1]=="all"){
22 if (show.alias) alias <- alias3fi(round(log2(x[[i]]$nruns)),x[[i]]$gen,order=2)
24 x[[i]]$nruns, " runs, ",
52 else if (!(nruns[1]=="all" & nfactors[1]=="all")){
53 if (!nruns[1]=="all") {
54 if (!is.numeric(nruns)) stop("nruns must be a numeric vector.")
55 if (!all(2^round(log2(nruns))==nruns))
57 x <- x[nruns.catlg(x) %in% nruns]
H A Destimable2fis.R17 if (ncol(estimable) > nruns - nfac - 1)
19 if (nruns > 32 & res3) {
42 nruns & dominating(catlg))]
53 nruns, " runs.")
55 if (nruns <= 64)
59 nruns, " runs.")
111 nruns, " runs.")
113 if (nruns <= 64)
117 nruns, " runs.")
298 … hilf <- FrF2(nruns=hilf$nruns,nfactors=hilf$nfac,generators=hilf$gen,randomize=FALSE)[,map[[1]]]
[all …]
H A Dgen2CIG.R20 gen2CIG <- function(nruns, gen){ argument
21 if (!is.numeric(nruns)) stop("nruns must be a number")
22 if (!length(nruns)==1) stop("nruns must be a single number")
23 k <- round(log2(nruns))
24 if (!nruns==2^k) stop("nruns must be a power of 2")
/dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/extlib/foxxll/foxxll/mng/
H A Dblock_alloc_strategy_interleaved.hpp35 interleaved_striping(int nruns, size_t begin_disk, size_t diff) in interleaved_striping()
36 : nruns_(nruns), begin_disk_(begin_disk), diff_(diff) in interleaved_striping()
40 interleaved_striping(int nruns, const striping& strategy) in interleaved_striping()
54 interleaved_fully_random(int nruns, const fully_random& strategy) in interleaved_fully_random()
55 : interleaved_striping(nruns, strategy.begin_, strategy.diff_) in interleaved_fully_random()
69 : interleaved_striping(nruns, strategy.begin_, strategy.diff_) in interleaved_simple_random()
72 for (int i = 0; i < nruns; i++) in interleaved_simple_random()
88 perms_(nruns, std::vector<size_t>(diff_)) in interleaved_random_cyclic()
90 for (int i = 0; i < nruns; i++) in interleaved_random_cyclic()
107 first_disk_only(int nruns, const single_disk& strategy) in first_disk_only()
[all …]
/dports/math/R-cran-DoE.base/DoE.base/R/
H A Dlowerbound_AR.R1 lowerbounds <- function(nruns, nlevels, R){ argument
12 r <- nruns%%pr
16 lowerbound_chi2 <- function(nruns, nlevels){ argument
32 n <- nruns
37 lowerbound_AR <- function(nruns, nlevels, R, crit="total"){ argument
40 hilf <- sum(lowerbounds(nruns, nlevels, R))/nruns^2
42 else return(max(hilf, lowerbound_chi2(nruns, nlevels)/nruns))
45 max(lowerbounds(nruns, nlevels, R))/nruns^2
H A Doa_feasible.R24 if (!nruns%% s^strength==0) {
31 if (nruns < bound){
38 if (nruns < bound) {
47 if (nruns < bound){
52 if (nruns==s^strength){
66 if (nruns > s^strength && !s==2){
69 lambda <- nruns%/%(s^strength)
95 if (nruns < bound){
111 if (nruns < bound){
138 if (nruns < bound){
[all …]
H A Dshow.oas.R1 show.oas <- function(name="all", nruns = "all", nlevels = "all", factors="all", argument
42 if (!identical(nruns, "all")){
43 if (!is.numeric(nruns)) stop("nruns must be numeric")
44 if (!all(nruns %% 1 == 0)) stop("nruns must be integer")
45 if (!length(nruns) %in% c(1,2)) stop("nruns must have one or two elements")
46 if (length(nruns)==1) zeige <- zeige[zeige$nruns==nruns,]
47 else zeige <- zeige[zeige$nruns>=min(nruns) & zeige$nruns<=max(nruns),]
H A Doa.design.R9 oa.design <- function(ID=NULL, nruns=NULL, nfactors=NULL, nlevels=NULL, argument
93 if (!is.null(nruns)) {
94 … if (nruns < minnrun) stop("Your request requires at least ", minnrun, ">", nruns, " runs.")
99 cand <- oacat[oacat$nruns >= nruns,]
101 else cand <- oacat[oacat$nruns >= minnrun,]
108 cand <- cand[cand$nruns<ffnrun,]
162 if (!(is.null(nruns))){
163 if (!nrow(des)==nruns)
166 if (!nruns==floor(nruns)) stop("nruns must be an integer number.")
168 else (nruns <- nrow(des))
[all …]
H A Dplanor2design.r5 nruns <- x@nunits functionVar
7 if (!nruns==nrow(aus)) stop("this planordesign object cannot be forced to class design")
9 ro <- 1:nruns
12 nruns = nruns, nfactors = length(fn@levels), nameattr
52 nruns = nr, nfactors = nc, nameattr
/dports/comms/wsjtz/wsjtx/lib/
H A Dfer13 nruns=0
20 while [ $nruns -lt 1000 ]
34 nruns=$[$nruns + 1]
35 nmissed=$[$nruns-$ngood]
36 pe=$( echo "scale=5; $nmissed/$nruns" | bc -l )
37 ps=$( echo "scale=5; $ngood/$nruns" | bc -l )
38 …echo -en snr: $snr nruns: $nruns ndecodes: $ndecodes ngood: $ngood nbad: $nbad nmissed: $nmissed w…
40 echo snr: $snr nruns: $nruns ndecodes: $ndecodes ngood: $ngood nbad: $nbad nmissed: $nmissed wer: $…
/dports/devel/stxxl/stxxl-1.4.1/include/stxxl/bits/mng/
H A Dblock_alloc_interleaved.h29 int_type nruns;
33 interleaved_striping(int_type nruns, unsigned_type begindisk, unsigned_type diff) in interleaved_striping()
34 : nruns(nruns), begindisk(begindisk), diff(diff) in interleaved_striping()
39 : nruns(_nruns), begindisk(strategy.begin), diff(strategy.diff) in interleaved_striping()
44 return begindisk + (i / nruns) % diff; in operator()
72 for (int_type i = 0; i < nruns; i++) in interleaved_SR()
78 return begindisk + (i / nruns + offsets[i % nruns]) % diff; in operator()
88 perms(nruns, std::vector<unsigned_type>(diff)) in interleaved_RC()
90 for (int_type i = 0; i < nruns; i++) in interleaved_RC()
102 return begindisk + perms[i % nruns][(i / nruns) % diff]; in operator()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/utilib/src/exec/doe/
H A Dxu_doe.cpp125 const long int t = nruns; in Bound()
127 const int m = nruns; in Bound()
224 int J2 = J2Prev + nruns*sk*sk*(nruns/sk-1)/2; in AddOAColumn()
225 …MYD( cerr << "J2 " << J2 << " " << J2Prev << " " << nruns*sk*sk*(nruns/sk-1)/2 << " " << nruns << … in AddOAColumn()
312 unsigned int nruns, in woa() argument
325 c.resize(nruns); in woa()
326 x.resize(nruns); in woa()
327 xbest.resize(nruns); in woa()
334 c[i].resize(nruns); in woa()
584 int nruns; in main() local
[all …]
/dports/science/cdo/cdo-2.0.0/src/
H A DCDIread.cc50 auto nruns = (cdo_operator_argc() == 1) ? parameter_to_int(cdo_operator_argv(0)) : 1; in CDIread() local
51 if (nruns < 0) nruns = 0; in CDIread()
52 if (nruns > 99) nruns = 99; in CDIread()
54 if (Options::cdoVerbose) cdo_print("nruns : %d", nruns); in CDIread()
58 for (int irun = 0; irun < nruns; ++irun) in CDIread()
128 if (nruns > 1) snprintf(sinfo, sizeof(sinfo), "(run %d)", irun + 1); in CDIread()
133 …if (nruns > 1) print_stat("(mean)", memtype, datatype, filetype, nvalues, data_size, file_size, tw… in CDIread()
H A DCDIwrite.cc45 int nruns = 1; in CDIwrite() local
59 if (cdo_operator_argc() > 0) nruns = parameter_to_int(cdo_operator_argv(0)); in CDIwrite()
65 nruns = std::min(std::max(nruns, 0), 9999); in CDIwrite()
85 cdo_print("nruns : %d", nruns); in CDIwrite()
135 for (int irun = 0; irun < nruns; ++irun) in CDIwrite()
195 if (nruns > 1) snprintf(sinfo, sizeof(sinfo), "(run %d)", irun + 1); in CDIwrite()
200 …if (nruns > 1) print_stat("(mean)", memtype, datatype, filetype, nvalues, data_size, file_size, tw… in CDIwrite()
/dports/math/sprng/sprng5/TESTS/
H A Dfft.cpp47 void Analyze(int nstreams, int nruns, int n);
48 void FFTCalc (int nstreams, int nruns, int n);
57 int i, seed, param, nruns, nstreams, n, *stream, myid=0, nprocs=1; in main() local
88 nruns = atoi(argv[5]); /* number of runs to repeat */ in main()
111 FFTCalc(nstreams,nruns,n); in main()
116 Analyze(nstreams,nruns,n); in main()
133 void Analyze(int nstreams, int nruns, int n) in Analyze() argument
168 StdDev1 = sqrt((double)nstreams*(double)n/(double)nruns/12.0); in Analyze()
169 StdDev2 = sqrt((double)nstreams*(double)n/(double)nruns/24.0); in Analyze()
212 void FFTCalc(int nstreams, int nruns, int n) in FFTCalc() argument
[all …]
/dports/math/sprng/sprng5/TESTS/mpitests/
H A Dfft.cpp47 void Analyze(int nstreams, int nruns, int n);
48 void FFTCalc (int nstreams, int nruns, int n);
57 int i, seed, param, nruns, nstreams, n, *stream, myid=0, nprocs=1; in main() local
88 nruns = atoi(argv[5]); /* number of runs to repeat */ in main()
111 FFTCalc(nstreams,nruns,n); in main()
116 Analyze(nstreams,nruns,n); in main()
133 void Analyze(int nstreams, int nruns, int n) in Analyze() argument
168 StdDev1 = sqrt((double)nstreams*(double)n/(double)nruns/12.0); in Analyze()
169 StdDev2 = sqrt((double)nstreams*(double)n/(double)nruns/24.0); in Analyze()
212 void FFTCalc(int nstreams, int nruns, int n) in FFTCalc() argument
[all …]
/dports/math/py-numexpr/numexpr-2.8.0/bench/
H A Dmultidim.py26 nruns = 10 # Ensemble for timing variable
75 for idx in range(nruns):
80 for idx in range(nruns):
85 for idx in range(nruns):
89 print("%s %s (average of %s runs)" % (test_shape, test_dtype, nruns))
90 print("Simple: ", (stop1-start1)/nruns)
91 print("Numexpr: ", (stop2-start2)/nruns)
92 print("Chunked: ", (stop3-start3)/nruns)
/dports/devel/stxxl/stxxl-1.4.1/include/stxxl/bits/algo/
H A Dsort.h73 int_type nruns, in create_runs() argument
100 assert(nruns >= 2); in create_runs()
167 run_type* run = runs[nruns - 1]; in create_runs()
217 for (irun = 0; irun < nruns; ++irun) in check_sorted_runs()
323 for (int_type i = 0; i < nruns; i++) in merge_runs()
547 for (i = 0; i < nruns; ++i) in sort_blocks()
564 while (nruns > 1) in sort_blocks()
572 int_type runs_left = nruns; in sort_blocks()
580 for (unsigned_type i = nruns - runs_left; i < (nruns - runs_left + runs2merge); i++) in sort_blocks()
619 runs_left = nruns; in sort_blocks()
[all …]
H A Dksort.h184 const unsigned_type nruns, in create_runs() argument
231 for ( ; k < nruns; k++) in create_runs()
455 for (i = 0; i < nruns; i++) in merge_runs()
504 losers(&prefetcher, nruns, cmp); in merge_runs()
518 for (i = 0; i < nruns; i++) in merge_runs()
591 for (i = 0; i < nruns; i++) in ksort_blocks()
609 while (nruns > 1) in ksort_blocks()
617 int_type runs_left = nruns; in ksort_blocks()
625 for (unsigned_type i = nruns - runs_left; i < (nruns - runs_left + runs2merge); i++) in ksort_blocks()
665 runs_left = nruns; in ksort_blocks()
[all …]
/dports/devel/stxxl/stxxl-1.4.1/tests/mng/
H A Dtest_block_alloc_strategy.cpp33 int nruns = 10; in test_strategy() local
35 …std::cout << "firstdisk=" << firstdisk << " ndisks=" << ndisks << " nruns=" << nruns << " runsi… in test_strategy()
36 interleaved itl2(nruns, strategy(firstdisk, firstdisk + ndisks)); in test_strategy()
37 for (int i = 0; i < nruns * runsize; ++i) { in test_strategy()
38 if (i % nruns == 0) in test_strategy()

12345678910>>...16