Rice U uses 81 million processor hours on Titan to trace protein conformations that may contribute to autoimmune disease Computer Science |
- Rice U uses 81 million processor hours on Titan to trace protein conformations that may contribute to autoimmune disease
- Computer Scientists suffer from Whorfian Syndrome.
- Modern day Metaprogramming?
- Monthly Hask Anything (March 2018)
- [Algorithm Question] Given a sorted list of values, find any number of values that add up to a target
- [Finite Automata] Help building a context free grammar where one element is a subset of the other?
- How to do a great review article on automated negotiator agents ?
- I Would Love Your Feedback
Posted: 28 Mar 2018 09:41 AM PDT |
Computer Scientists suffer from Whorfian Syndrome. Posted: 28 Mar 2018 06:19 PM PDT |
Posted: 28 Mar 2018 08:11 PM PDT I've a recent interest in "Metaprogramming" tasks such as code generation/replacement and Domain Specific Languages.
Thanks! [link] [comments] |
Monthly Hask Anything (March 2018) Posted: 28 Mar 2018 11:29 PM PDT |
Posted: 28 Mar 2018 08:43 PM PDT I was recently asked a question like this. The best answer I could come up with was to take each item and add the items that follow until I either run out of values, or until my running count went over the target. If my running count went over the target, I repeated the process but starting 1 index forward in the list. If I analyzed this correctly, I think this has a O(n!). Are there better algorithms that I can be using instead? [link] [comments] |
[Finite Automata] Help building a context free grammar where one element is a subset of the other? Posted: 28 Mar 2018 04:56 PM PDT The question build a CFG for {xR #y : x,y in {0,1}* and x is a substring of y} Thought process I understand that xR y where x = y is: S -> 0S0 | 1S1| null I'm having a tougher time with the substring portion. RIght now I have: S -> 0S0 | 1S1 | A | null A -> 1A | 0A | null THis essentially says that y ends in x, but I don't know how to append onto the S rule to add {0,1}* to the end without it ending up in the middle ( IE 0S0A could lead to 0A0A) Can I get pointed in the right direction? [link] [comments] |
How to do a great review article on automated negotiator agents ? Posted: 28 Mar 2018 02:43 PM PDT Hi ! I'm doing my first review article. wanted to know if you had tips or time to peer-review what I tried to achieve. Thank you for your help in advance ! I have to sum-up and comment on 4 pages on an article asking When Will Negotiation Agents Be Able to Represent Us. I'm not new to multiple-agent systems but rather new in automated negotiator. The only things I had to respect but the template were :
As far as it was my first attempt I followed the wikihow guide to summarize a journal article I know I should have rather used the How to Write an Article Review ... Here is my attempt. You can clone it with git with the following link : https://git.overleaf.com/15169278xzdfgnjvfmrb I have to give it back to my teacher before Friday Thank you very much for you help ! [link] [comments] |
Posted: 28 Mar 2018 04:41 PM PDT Hi all! I recently developed a K-nearest neighbors algorithm that outperforms the Scikit-Learn K-NN algorithm in terms of both classification speed and accuracy on the MNIST data set (repo linked below). I am not in college yet, and I don't have anyone to talk to about this kind of stuff, and I am wondering if this small project is perhaps something I could use as a piece in my portfolio when applying for jobs/research positions in CS/ML areas? Thanks! https://github.com/samgrassi01/Cosine-Similarity-Classifier [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