Timeline for Approximate version of a balanced incomplete block diagram
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2012 at 3:56 | vote | accept | Watson Ladd | ||
| Jul 15, 2012 at 19:29 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Jul 13, 2012 at 15:27 | comment | added | Watson Ladd | Gerhard, if you made that first comment an answer it would be the one I would accept. | |
| Jul 10, 2012 at 4:56 | comment | added | Gerhard Paseman | Also, unless you are forcing the workers to be isolated, you should be able to have a worker query on whether a particular pair of files is already being processed. Gerhard "Ask Me About System Design" Paseman, 2012.07.09 | |
| Jul 10, 2012 at 4:43 | comment | added | Gerhard Paseman | Cliqque covering, or covering of edges (2-sets) by cliques of various sizes (k-sets for varying k). For info on the problem for fixed k, consider the La Jolla Covering Repository. Doubtless the combinatorialists here will give even better references. Gerhard "Ask Me About System Design" Paseman, 2012.07.09 | |
| Jul 10, 2012 at 4:39 | answer | added | Douglas Zare | timeline score: 1 | |
| Jul 10, 2012 at 4:18 | history | asked | Watson Ladd | CC BY-SA 3.0 |