meta user
network profile
| bio | website | |
|---|---|---|
| location | Sydney, Australia | |
| age | 28 | |
| visits | member for | 2 years, 2 months |
| seen | Mar 11 at 3:28 | |
| stats | profile views | 23 |
|
Mar 6 |
comment |
linear equivalent min{} constraint I... suppose. But this only half solves the problem. When I said I had to use the $Y_i$ later, I have another $\text{min}\{\}$ which has a variable as one of the elements. So basically I still need to know the linear equivalent form for this expression. |
|
Mar 6 |
asked | linear equivalent min{} constraint |
|
Nov 13 |
comment |
Weighted convolution? @TimDuff I implemented what you suggested. Adding together weighted probabilities does seem a lot simpler than convolving them together. |
|
Nov 12 |
asked | Weighted convolution? |
|
Oct 2 |
asked | Branch-and-Price algorithms for IP/MIP |
|
Aug 28 |
awarded | Tumbleweed |
|
Aug 21 |
asked | Algorithms for solving/decomposing very large IP/MIP/BIP |
|
Nov 1 |
comment |
Test for randomness Thanks. We would be analysing machine code rather than plain text, but I see what you mean. I will try the entropy formula suggested by mhum. |
|
Nov 1 |
accepted | Test for randomness |
|
Nov 1 |
asked | Test for randomness |
|
Sep 23 |
accepted | Cooley-Tukey FFT with arbitrary radices |
|
Sep 23 |
asked | Cooley-Tukey FFT with arbitrary radices |
|
Sep 12 |
comment |
Optimal division sequences for divide-and-conquer algorithms @Gerry: Good observation. So I guess I need to do some experimental analysis on which of the down-to-one sequences performs the best in practice. |
|
Sep 12 |
revised |
Optimal division sequences for divide-and-conquer algorithms added 708 characters in body |
|
Sep 12 |
awarded | Editor |
|
Sep 12 |
revised |
Optimal division sequences for divide-and-conquer algorithms added 139 characters in body |
|
Sep 12 |
asked | Optimal division sequences for divide-and-conquer algorithms |
|
Sep 2 |
awarded | Popular Question |
|
Sep 2 |
awarded | Nice Question |
|
Sep 2 |
awarded | Supporter |
