Home
last modified time | relevance | path

Searched refs:upper_bounds (Results 1 – 25 of 690) sorted by relevance

12345678910>>...28

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/unit_test/
H A Ddakota_hdf5_dist_params.in24 upper_bounds 4.0 3.9
27 upper_bounds 3 2
43 upper_bounds inf 0.6
48 upper_bounds 1e5 1.5
51 upper_bounds 1.5 2.0
54 upper_bounds 1.5 1.0
58 upper_bounds 2.0 3.0
66 # upper_bounds 4.0 5.0
120 upper_bounds 3 4 5 6 7
138 upper_bounds 0.3 0.4
[all …]
/dports/devel/caf/actor-framework-0.18.5/libcaf_core/caf/telemetry/
H A Dhistogram.hpp47 span<const value_type> upper_bounds) { in histogram() argument
49 init_buckets(upper_bounds); in histogram()
52 explicit histogram(std::initializer_list<value_type> upper_bounds) in histogram() argument
54 make_span(upper_bounds.begin(), upper_bounds.size())) {
96 void init_buckets(span<const value_type> upper_bounds) { in init_buckets() argument
97 CAF_ASSERT(std::is_sorted(upper_bounds.begin(), upper_bounds.end())); in init_buckets()
99 num_buckets_ = upper_bounds.size() + 1; in init_buckets()
102 for (; index < upper_bounds.size(); ++index) in init_buckets()
103 buckets_[index].upper_bound = upper_bounds[index]; in init_buckets()
H A Dmetric_registry.hpp351 upper_bounds_list upper_bounds; in histogram_family() local
360 upper_bounds = std::move(*lst); in histogram_family()
365 if (upper_bounds.empty()) in histogram_family()
366 upper_bounds.assign(default_upper_bounds.begin(), in histogram_family()
371 std::move(upper_bounds)); in histogram_family()
382 span_t<ValueType> upper_bounds, string_view helptext, in histogram_family() argument
385 return histogram_family<ValueType>(prefix, name, lbl_span, upper_bounds, in histogram_family()
412 span_t<label_view> labels, span_t<ValueType> upper_bounds, in histogram_instance() argument
425 span_t<ValueType> upper_bounds, string_view helptext, in histogram_instance() argument
451 span_t<ValueType> upper_bounds, string_view helptext, in histogram_singleton() argument
[all …]
/dports/misc/opennn/opennn-5.0.5/opennn/
H A Dbounding_layer.cpp148 return upper_bounds; in get_upper_bounds()
184 return upper_bounds(i); in get_upper_bound()
196 upper_bounds.resize(0); in set()
220 upper_bounds.resize(new_inputs_number); in set_inputs_number()
230 upper_bounds.resize(new_neurons_number); in set_neurons_number()
255 upper_bounds = other_bounding_layer.upper_bounds; in set()
387 upper_bounds = new_upper_bounds; in set_upper_bounds()
419 upper_bounds.resize(neurons_number); in set_upper_bound()
423 upper_bounds[index] = new_upper_bound; in set_upper_bound()
509 else if(inputs(i,j) > upper_bounds(j)) outputs(i,j) = upper_bounds(j); in calculate_outputs()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/DDACE/src/Sampling/
H A DDDaceCentralCompositeSampler.cpp72 std::vector<double> upper_bounds(nInputs_); in getSamples() local
75 upper_bounds[i] = dist_[i].upperBound(); in getSamples()
81 x[k] = 0.5*(lower_bounds[k]+upper_bounds[k]); in getSamples()
88 x[j] = 0.5*(lower_bounds[j]+upper_bounds[j]); in getSamples()
92 x[i] = upper_bounds[i]; in getSamples()
101 stepSize[j] = upper_bounds[j]-lower_bounds[j]; in getSamples()
109 fullFactorialPoints(currentIndex, nInputs_, lower_bounds, upper_bounds, in getSamples()
117 const std::vector<double>& upper_bounds, const std::vector<double>& stepSize, in fullFactorialPoints() argument
132 fullFactorialPoints(nextIndex, numVars, lower_bounds, upper_bounds, in fullFactorialPoints()
/dports/science/dftbplus/dftbplus-19.1/tools/dptools/src/dptools/
H A Dgrids.py49 self.upper_bounds = self.ranges[:, 1]
50 self.shape = self.upper_bounds - self.lower_bounds
164 upper_bounds = subgrid.upper_bounds + suborig_int
166 contained = contained and np.all(upper_bounds <= self.upper_bounds)
169 return np.transpose([lower_bounds, upper_bounds])
188 upper_bounds = np.min([self.upper_bounds, other_upper_bounds], axis=0)
190 upper_bounds = np.ceil(upper_bounds).astype(int)
191 gridranges = np.vstack((lower_bounds, upper_bounds)).transpose()
224 gridcoords < self.upper_bounds)
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/test/
H A Ddakota_pstudy_allvars.in19 upper_bounds = 20. #s0,#s1,#s4
22 upper_bounds = 7 #s0,#s1
37 upper_bounds = 300. #s0,#s2
40 upper_bounds = 10. #s0,#s2,#s4
44 upper_bounds = 2. #s0,#s2
51 upper_bounds = 2. #s0,#s2
88 upper_bounds = 5. 8. #s0,#s3
92 upper_bounds = 5 8 #s0,#s3
101 upper_bounds = 20. #s0,#s1
104 upper_bounds = 7 #s0,#s1
H A Ddakota_sampling_doptimal.in33 # upper_bounds = 20.
39 # upper_bounds = 7
60 upper_bounds = 300. #s0,#s2
63 upper_bounds = 10. #s0,#s2
67 upper_bounds = 2. #s0,#s2
74 upper_bounds = 2. #s0,#s2
119 # upper_bounds = 5. 8.
124 # upper_bounds = 5 8
136 # upper_bounds = 20.
142 # upper_bounds = 7
H A Ddakota_sbouu3_tbch.in34 upper_bounds 2.164 4.0
100 # upper_bounds = 286.1, 682.4
104 upper_bounds = 298.5, 712.
110 # upper_bounds = 275., 640.
147 # upper_bounds = 286.1, 682.4
151 upper_bounds = 298.5, 712.
157 # upper_bounds = 275., 640.
H A Ddakota_var_views_dace.in42 upper_bounds 2. 2.
46 upper_bounds 3. 3. #s0,#s1,#s2,#s3,#s4,#s5,#s6
48 # upper_bounds 2. 2. #s7,#s8,#s9,#s10,#s11,#s12,#s13
54 upper_bounds 3. 3. #s0,#s1,#s2,#s3,#s4,#s5,#s6
56 # upper_bounds 2. 2. #s7,#s8,#s9,#s10,#s11,#s12,#s13
61 upper_bounds 3. 3. #s0,#s1,#s2,#s3,#s4,#s5,#s6
64 # upper_bounds 2. 2. #s7,#s8,#s9,#s10,#s11,#s12,#s13
H A Ddakota_sbouu4_tbch.in32 upper_bounds 2.164 4.0
126 # upper_bounds = 286.1, 682.4
130 upper_bounds = 298.5, 712.
136 # upper_bounds = 275., 640.
173 # upper_bounds = 286.1, 682.4
177 upper_bounds = 298.5, 712.
183 # upper_bounds = 275., 640.
H A Ddakota_trsbouu4_tbch.in42 upper_bounds 2.164 4.0
139 # upper_bounds = 286.1, 682.4
142 upper_bounds = 298.5, 712.
147 # upper_bounds = 275., 640.
182 # upper_bounds = 286.1, 682.4
185 upper_bounds = 298.5, 712.
190 # upper_bounds = 275., 640.
H A Ddakota_var_views_opt.in36 upper_bounds 2. 2.
40 upper_bounds 3. 3. #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8
41 # upper_bounds 2. 2. #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s17
47 upper_bounds 3. 3. #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8
48 # upper_bounds 2. 2. #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s17
55 upper_bounds 3. 3. #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8
56 # upper_bounds 2. 2. #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s17
H A Ddakota_rol.in20 upper_bounds 5.8 2.9 #s0
24 # upper_bounds 50*2. #s16
31 # upper_bounds 7*1. #s1
39 # upper_bounds 2.0 2.0 #s2,#s3
47 # upper_bounds 5*2.0 #s4,#s5,#s6,#s7,#s8,#s9,#s10,#s11,#s12,#s13,#s14,#s15
55 # upper_bounds 2*100.0 #s17,#s18
63 # upper_bounds 2.164 4.0 #s19,#s20,#s21,#s22
71 # upper_bounds 2*10.0 #s23,#s24,#s29,#s30
99 upper_bounds 0.0 0.0 #s0
H A Ddakota_uq_rosenbrock_verify.in19 # upper_bounds = 2. 2. #s1
28 # upper_bounds = 2. 2. #s3
40 # upper_bounds = 2. #s5
49 # upper_bounds = 2. #s5
H A Ddakota_coliny.in122 upper_bounds 10.0 10.0 10.0 #s0,#s1
123 # upper_bounds 10.0 10.0 10.0 #s2,#s3,#s4,#s5,#s6,#s7
124 # upper_bounds 10.0 10.0 10.0 #s8,#s9,#s12,#s13,#s14,#s15
125 # upper_bounds 10.0 10.0 10.0 #s16,#s17,#s18,#s19,#s21
126 # upper_bounds 10.0 10.0 10.0 #s22,#s23,#s24,#s25,#s26,#s27,#s28
127 # upper_bounds 10.0 10.0 10.0 #s29,#s30,#s31,#s32,#s33,#s34,#s35
128 # upper_bounds 2.0 2.0 2.0 #s20
144 # upper_bounds 4 9 #s22,#s23,#s24,#s25,#s26
145 # upper_bounds 4 9 #s27,#s28,#s29,#s30,#s31
H A Ddakota_ouu1_tb.in64 upper_bounds 2.164 4.0
89 upper_bounds = .1 #s0,#s1
92 # upper_bounds = 1.e+6 1.e+6 #s2,#s3
94 # upper_bounds = 1.e+50 1.e+50 #s4,#s5,#s6
95 # upper_bounds = 1.2e+05 3.5e+05 #s7,#s8,#s9
137 upper_bounds = 298.5 712.
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DPEBBLBranching.cpp72 upper_bounds.resize(subModel.continuous_upper_bounds().length()); in setRootComputation()
78 upper_bounds[i] = subModel.continuous_upper_bounds()[i]; in setRootComputation()
89 subModel.continuous_upper_bounds(upper_bounds); in boundComputation()
176 temp->pebbldSubAsChildOf(this, splitVar, whichChild, candidate_x, lower_bounds, upper_bounds); in makeChild()
200 upper_bounds.resize(subModel.continuous_upper_bounds().length()); in pebbldSubAsChildOf()
206 upper_bounds[i] = _upper_bounds[i]; in pebbldSubAsChildOf()
212 upper_bounds[_splitVar] = floor(cont_vars[_splitVar]); in pebbldSubAsChildOf()
213 if(cont_vars[_splitVar]>upper_bounds[_splitVar]) in pebbldSubAsChildOf()
214 cont_vars[_splitVar] = upper_bounds[_splitVar]; in pebbldSubAsChildOf()
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/examples/
H A Dmore_garbow_hillstrom.cc166 const double TestProblem3::upper_bounds[] = {1.0, 9.0}; member in ceres::examples::TestProblem3
181 const double TestProblem4::upper_bounds[] = {1000000.0, 100.0}; member in ceres::examples::TestProblem4
196 const double TestProblem5::upper_bounds[] = {10.0, 100.0}; member in ceres::examples::TestProblem5
231 const double TestProblem7::upper_bounds[] = {0.8, 1.0, 1.0}; member in ceres::examples::TestProblem7
256 const double TestProblem8::upper_bounds[] = { member in ceres::examples::TestProblem8
279 const double TestProblem9::upper_bounds[] = {4.2, 2.0, 0.1}; member in ceres::examples::TestProblem9
301 const double TestProblem10::upper_bounds[] = { member in ceres::examples::TestProblem10
362 const double TestProblem13::upper_bounds[] = { member in ceres::examples::TestProblem13
410 const double TestProblem15::upper_bounds[] = { member in ceres::examples::TestProblem15
458 const double TestProblem17::upper_bounds[] = { member in ceres::examples::TestProblem17
[all …]
/dports/math/ceres-solver/ceres-solver-2.0.0/examples/
H A Dmore_garbow_hillstrom.cc169 const double TestProblem3::upper_bounds[] = {1.0, 9.0}; member in ceres::examples::TestProblem3
199 const double TestProblem5::upper_bounds[] = {10.0, 100.0}; member in ceres::examples::TestProblem5
234 const double TestProblem7::upper_bounds[] = {0.8, 1.0, 1.0}; member in ceres::examples::TestProblem7
259 const double TestProblem8::upper_bounds[] = { member in ceres::examples::TestProblem8
282 const double TestProblem9::upper_bounds[] = {4.2, 2.0, 0.1}; member in ceres::examples::TestProblem9
304 const double TestProblem10::upper_bounds[] = { member in ceres::examples::TestProblem10
345 const double TestProblem12::upper_bounds[] = {2.0, 9.5, 20.0}; member in ceres::examples::TestProblem12
365 const double TestProblem13::upper_bounds[] = { member in ceres::examples::TestProblem13
413 const double TestProblem15::upper_bounds[] = { member in ceres::examples::TestProblem15
461 const double TestProblem17::upper_bounds[] = { member in ceres::examples::TestProblem17
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/surfpack/src/
H A DConmin.cpp17 void Conmin::bounds(const VecDbl& lower_bounds, const VecDbl& upper_bounds) in bounds() argument
19 assert(upper_bounds.size() == lower_bounds.size()); in bounds()
20 upperBounds = upper_bounds; in bounds()
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/arith/
H A Dsolve_linear_inequality.cc225 for (auto ub = upper_bounds->begin(); ub != upper_bounds->end();) { in MoveEquality()
230 ub = upper_bounds->erase(ub); in MoveEquality()
324 std::unordered_set<PrimExpr, StructuralHash, StructuralEqual> upper_bounds; in SolveLinearInequalities() local
326 upper_bounds.reserve(coef_pos.size()); in SolveLinearInequalities()
333 if (std::any_of(upper_bounds.begin(), upper_bounds.end(), in SolveLinearInequalities()
340 for (auto iter = upper_bounds.begin(); iter != upper_bounds.end();) { in SolveLinearInequalities()
342 iter = upper_bounds.erase(iter); in SolveLinearInequalities()
348 upper_bounds.insert(bound); in SolveLinearInequalities()
373 equal.reserve(std::min(upper_bounds.size(), lower_bounds.size())); in SolveLinearInequalities()
374 MoveEquality(&upper_bounds, &lower_bounds, &equal); in SolveLinearInequalities()
[all …]
/dports/science/simbody/simbody-Simbody-3.7/examples/
H A DParameterConstrainedOptimization.cpp76 Vector upper_bounds(NUMBER_OF_PARAMETERS); in main() local
89 upper_bounds[i] = 100.0; in main()
93 upper_bounds[i] = 100.0; in main()
96 sys.setParameterLimits( lower_bounds, upper_bounds ); in main()
/dports/science/mbdyn/mbdyn-1.7.3/mbdyn/aero/
H A Daerodata.cc523 upper_bounds[i] = HP.GetReal(); in ReadC81MultipleAeroData()
524 if (upper_bounds[i] <= -1.) { in ReadC81MultipleAeroData()
525 if (!bInterp || upper_bounds[i] < -1.) { in ReadC81MultipleAeroData()
527 << i + 1 << " = " << upper_bounds[i] in ReadC81MultipleAeroData()
534 } else if (upper_bounds[i] > 1.) { in ReadC81MultipleAeroData()
537 << upper_bounds[i] in ReadC81MultipleAeroData()
543 } else if (i > 0 && upper_bounds[i] <= upper_bounds[i-1]) { in ReadC81MultipleAeroData()
545 << i+1 << " = " << upper_bounds[i] in ReadC81MultipleAeroData()
563 if (upper_bounds[nProfiles - 1] != 1.) { in ReadC81MultipleAeroData()
580 eInst, profiles, upper_bounds, data, in ReadC81MultipleAeroData()
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/math_opt/
H A Dmodel_update.proto35 // Updates ModelProto.variables.upper_bounds.
38 // * upper_bounds.ids must be from ModelProto.variables.ids.
39 // * upper_bounds.values must be > -infinity.
41 SparseDoubleVectorProto upper_bounds = 2; field
80 // Updates ModelProto.linear_constraints.upper_bounds.
83 // * upper_bounds.ids must be from ModelProto.linear_constraints.ids.
84 // * upper_bounds.values must be > -infinity.
86 SparseDoubleVectorProto upper_bounds = 2; field

12345678910>>...28