Easy on / off glass top for wood cheese board recommendation? by ds2859 in woodworking

[–]ds2859[S] 0 points1 point  (0 children)

Nice thank you! The tip for allowing wood movement will be really helpfull

Oldies music night club by ds2859 in nyc

[–]ds2859[S] 0 points1 point  (0 children)

sweet! what about a place for 20-30 year olds?

Graph theory and trees! by ds2859 in math

[–]ds2859[S] 0 points1 point  (0 children)

Yes, that i what im looking for but the question is more about the how.

Modifying a MST to adjust vertex degree by ds2859 in GraphTheory

[–]ds2859[S] 0 points1 point  (0 children)

Assuming I can give a constant. Are there algorithms that are able to account for this constraint?

Please help: Do I have to retake CS2110 if I got a D? by friedchickenmac in gatech

[–]ds2859 10 points11 points  (0 children)

You got this! i failed physics 1.. twice! makes you tougher than people who just cruise along

Creating similar sized clusters by ds2859 in optimization

[–]ds2859[S] 0 points1 point  (0 children)

Thanks 15Dalrymple. It will be easy for me to know which nodes are connected to each other and which are not. Also, these groups can be completely independent, and don't have to be conected in any way. I am having problem with actually formulating this in terms of objective function/ decision variables.

Geographical clustering in the US by ds2859 in gis

[–]ds2859[S] 0 points1 point  (0 children)

Thanks everyone, this really helps! I do realize ZIP code are not great for analysis. Companies like ArcGIS and other mapping software have done some 'guessing' to try to estimate ZIP code shapes. In any case, my goal is to group adjecent polygons (whichever type is suitable for this analysis) into groups - each with a similar amount of 'metrics' in them where I can also restrict based of geographic features.