Phil 1.26.18

7:00 – 4:00 ASRC MKT

  • Tweaked my hypotheses from this post. I need to promote to a Phlog page.
  • Using Self-Organizing Maps to solve the Traveling Salesman Problem
    • The Traveling Salesman Problem is a well known challenge in Computer Science: it consists on finding the shortest route possible that traverses all cities in a given map only once. To solve it, we can try to apply a modification of the Self-Organizing Map (SOM) technique. Let us take a look at what this technique consists, and then apply it to the TSP once we understand it better.
  • Starting JuryRoom project with Jeremy.
    • Angular material  design
    • VerdictBox (Scenario and verdict)
    • Chat message
    • Live discussion cards (right gutter)
    • Topics (alphabetic, ranking, trending) with sparklines
    • Progress!!!!!! JuryRoom

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.