What are the best courses for Computer science you ever studied from? Computer Science |
- What are the best courses for Computer science you ever studied from?
- What does the intersection between CS and Physics look like? What are some of the most interesting works in that area?
- Software and Hardware
- Course advise
- Efficient distributed DAG computation engine for very large graphs of very small operators?
- Geovisualization of the Traveling Salesman Problem main heuristics
- Uglification - Angular 4
What are the best courses for Computer science you ever studied from? Posted: 24 Feb 2018 09:18 AM PST Please share only courses that you personally studied from [link] [comments] |
Posted: 24 Feb 2018 06:12 PM PST More specifically, what does the intersection between Theoretical CS and Physics look like? I'm referring to things in the vein of the relationship between Thermodynamics and Information Theory , not something like the use of computers to model physical systems [link] [comments] |
Posted: 25 Feb 2018 12:34 AM PST I am still in university figuring out what to do after I graduate, but some of the options I am considering are:
How important is hardware in any of these careers? Cause tbh, I don't think hardware is my cup of tea. If it so important, any advice on what I could do to be able to learn "like" and "love" hardware? Thank you in advanced! [link] [comments] |
Posted: 24 Feb 2018 08:38 PM PST Hi everyone, I am looking to enrol on one of the following courses, so i'd appreciate some advise: 2) https://qualifications.pearson.com/en/qualifications/btec-higher-nationals/computing-2017.html Now I'd like to know which one stands out as better between these two? Kindly have a look at the specs and let me know which course units will be more beneficial to me in long term. Thanks [link] [comments] |
Efficient distributed DAG computation engine for very large graphs of very small operators? Posted: 24 Feb 2018 06:30 PM PST I think I accidentally found a really hard problem. For a project I'm working on, I need to intelligently compute very large DAGs (well over a million nodes), of varying levels of sparsity, with very small operators (ie a single '+'). The number of operators would be predetermined and small compared to the number of nodes. Normally you'd build a small front end to the LLVM or use apache spark or similar (I know spark is not the correct choice, it's just a widely known example), but this too small for the large overhead of things akin to apache spark, can't be done on LLVM due to needing to distribute across multiple systems, and ideally making it run on GPUs just makes it an even harder. Does anyone have any ideas about if software to do this exists? [link] [comments] |
Geovisualization of the Traveling Salesman Problem main heuristics Posted: 24 Feb 2018 04:32 AM PST I've been working on this project for a few weeks: https://github.com/afourmy/pyTSP The idea is to solve the TSP with different algorithms, including genetic algorithm and linear programming. I'd really appreciate some help / feedback on the genetic algorithm specifically because for some reason, it does not perform well. The code for the GA is here: https://github.com/afourmy/pyTSP/blob/master/algorithms/genetic_algorithm.py As stated in the readme:
Basically, I generate a random generation, cross the parents, mutate the offspring, and select the 10 best out of 30 randomly chosen offsprings. I would expect the GA to yield a solution at most 5% longer than the best one in about 100 generations (sounds reasonnable to me), but the results I get are much worse than that. I'm wondering if there's something wrong with the algorithm itself (can't figure out what), or if it's a more suttle bug (websockets that I use for triggering a new generation?). I uploaded a demo of the project here: http://mintoo.pythonanywhere.com The genetic algorithm is deactivated because it relies on websockets, which the hosting platform does not support. As for the other algorithms, I think they're fine but again, any feedback appreciated ! [link] [comments] |
Posted: 24 Feb 2018 09:13 AM PST I was looking into the benefits of Angular 4 and when i came to the section on when you run Build. It has a set of operations it runs and one of them is 'Uglification'. As they define it : 'rewrites code to use short, cryptic variable and function names.' Is it me or isn't this good security wise as somebody trying to inspect your build version wouldn't have a clue what they are looking at? Or is it something completely different? [link] [comments] |
You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment