Upperbound refers to the maximum limit or the highest capacity a system can handle.
Questions tagged [upperbound]
137 questions
0
votes
1 answer
How to describe the extent (error band) of the clustering result(clustering center)?
I performed a k-means on a very large data, which has millions of rows and each row contains a 48-dimension vector. By applying k = 3, these data are clustered into three class, each class has a 48-dimension clustering center vector. I plot three…
Xi Wang
- 21
- 5
0
votes
3 answers
How did they find Lower Bound of the following code?
procedure stars(n)
for i = 1, . . . , n do
print “∗” i many times
Question - Using the Ω-notation, lowerbound the running time of stars to show that your upperbound is in fact asymptotically tight.
Solution - Assume for simplicity that n…
lynxx
- 544
- 3
- 18
0
votes
0 answers
Understanding Concept of Lowerbound and Upperbound in Random Number Generation?
I'm new at Java and trying to understand the concept of generating a random number within a specific range (of 500000 to 999999).
I wrote a function:
public int generateRandom(){
Random random = new Random();
return (int num =…
James McTyre
- 103
- 7
0
votes
2 answers
How to calculate Upper-Bound on Playback Buffer?
Good Afternoon,
I've tried all I can think of for the following question and rewatched the example video over 7 times. I know it involves adding the maximum buffer sizes or rates to one another, but I just cannot seem to grasp it:
Consider two…
MaddieSun
- 101
- 8
0
votes
1 answer
How to set an start solution in Gurobi, when only objective function is known?
I have a minimization problem, that is modeled to be solved in Gurobi, via python.
Besides, I can calculate a "good" initial solution for the problem separately, that can be used as an upper bound for the problem.
What I want to do is to set Gurobi…
Mostafa
- 113
- 9
0
votes
0 answers
Upper bound rush hour game
I'm trying to understand the upper bound complexity for a Rush Hour game puzzle. I'm dealing with a 9x9 board, with 22 vehicles, including trucks (3 grids long) and cars (2 grids long).
By my logic, given the fact that a car can move 8 times over a…
R A
- 95
- 3
- 13
0
votes
2 answers
How to use upper_bound on array of pair in C++?
I want to use upper_bound on array of pair and that too using a comparator function that compares the second parameter of pair. Please help.
Code:
bool cmp(const pair &p1, const pair &p2)
{
return p1.second
Michelle
- 97
- 1
- 10
0
votes
1 answer
Finding lower and upper bound to complexity
I want to find lower and upper bound to complexity of this algorithm
1: for all i=1 to n*n do
2: for all j=i to 2*i do
3: output “hello world”
4: end for
5: end for
By writing it down as summation and simplifying it to
f(n) = 0.5*n^4 +…
Jeff Nama
- 61
- 5
0
votes
1 answer
Proving an upper bound to F(x)+G(x)
I have stumbled upon the following question:
If f(x),g(x) > 1 for every x, prove/disprove the following:
f(x)+g(x)= O(f(x)*g(x))
I dont know how to start the proof, this is very basic for my level, please help.
Eiad Amer
- 1
- 1
0
votes
0 answers
Triple-nested Java Generics
I am trying to understand Java Generics and UpperBound Wildcards on more complicated examples.
I have a list of lists of anything that extends a list of any type of object:
List>> veryNestedList;
I was thinking whether I the…
Taks
- 2,033
- 4
- 18
- 23
0
votes
1 answer
Find the bounds as tight as possible?
2^n −8 = O(2^n)
It says there are some positive constants c and n0 for which
0 <= f(n) <= cg(n) for all n >= n0
I solved it as:
2^n −8 <= c2^n
If c = 1, and n0 = 1
1-8 <= 1*1
-7<= 1
then for all n >= n0 it remains true.
which is true but I don't…
Muhammad Hamza
- 213
- 1
- 4
- 14
0
votes
2 answers
Asymptotic Upper Bound
Hi I solved a question with recursion tree method. Then I reached the below equatition.
n
∑ 3^(i-1)(n - (i - 1))
i=1
I need to find asymptotic upper bound for that equation. Any help would be appreciated.
trial
- 19
- 1
- 6
0
votes
1 answer
java: Big-Oh order of this do-while code fragment? Plus a tight upper bound
I know this is easy but my textbook doesn't talk about Big-Oh order with do-while loops, and neither do any of my other algorithm sources.
This problem states that the following code fragment is parameterized on the variable "n", and that a tight…
Ryan Horner
- 123
- 1
- 1
- 7
0
votes
0 answers
upper/lower_bound wrong comparison function parameter order
cpprefernce says:
template< class ForwardIt, class T, class Compare > ForwardIt
upper_bound( ForwardIt first, ForwardIt last, const T& value, compare comp );
(...)
comp - comparison function object (i.e. an object that satisfies the
…
Patryk
- 22,602
- 44
- 128
- 244
0
votes
1 answer
Query set restriction SQL database
Name Gender School Position Salary
-----------------------------------------------------------
Alex Male Computing Lecturer $80,000
Bob Male Mathematics Lecturer $60,000
Carol Female …
Sjapit
- 17
- 3