# | User | Rating |
---|---|---|
1 | tourist | 3771 |
2 | jiangly | 3688 |
3 | Um_nik | 3539 |
4 | slime | 3498 |
5 | djq_cpp | 3486 |
6 | MiracleFaFa | 3466 |
7 | ksun48 | 3452 |
8 | Radewoosh | 3406 |
9 | greenheadstrange | 3393 |
10 | xtqqwq | 3382 |
# | User | Contrib. |
---|---|---|
1 | -is-this-fft- | 183 |
2 | awoo | 181 |
3 | YouKn0wWho | 177 |
4 | Um_nik | 175 |
5 | dario2994 | 172 |
6 | Monogon | 171 |
7 | adamant | 168 |
8 | maroonrk | 167 |
9 | antontrygubO_o | 166 |
10 | errorgorn | 164 |
![]() mkagenius
|
11 years ago,
#
|
![]() ![]() Can this be used to find the highest point of the lowest envelope?
(i will use it in graphical method to solve two-person-zero-sum game (2Xn matrix) ) If yes , then plz tell how ? (if you have free time :) )
→
Reply
|
![]() MarioYC
|
11 years ago,
#
^
|
![]() ![]() Hi, I haven't finished reading it, but decided to share it, since I haven't heard about it before. Now, about the highest I think it wouldn't be hard to find if you have the lines which form the segments that form the lowest envelope, as far as I understand the method gives you that. :)
→
Reply
|
Name |
---|