Making a discord server for beginners to learn C++ and algorithms through competitive programming Computer Science |
- Making a discord server for beginners to learn C++ and algorithms through competitive programming
- Are "sparse" automata possible?
- Inching closer to a DNA-based file system -- ArsTechnica
- Idea to solve traveling salesman problem, is this stupid or not?
| Making a discord server for beginners to learn C++ and algorithms through competitive programming Posted: 20 Feb 2018 10:34 PM PST Hello! I have a discord server where our group of members do competitive programming contests together on codeforces.com We'd love to have you! We discuss problems, support each other, and even have an experienced competitive programmer mentoring us. Here's the invite link https://discord.gg/rJBAn5N [link] [comments]  |
| Are "sparse" automata possible? Posted: 20 Feb 2018 01:43 PM PST Hey, I've been poking around with minimisation algorithms on acyclic automata and I noticed that a some of my patterns are quite sparse. What I mean by sparse is basically a pattern like "...a...b" where the wildcards are pretty much just filler in order to make sure that the "a" and "b" match in the correct position rather than having any importance themselves (the wildcards are supposed to be replaced by other states). So merging with a pattern like "c...d" would lead to "c..ad..b". So what I'm wondering whether it's possible to get rid of the wildcards and still have an acyclic automata that minimises correctly? Research papers on this, or similar topics are especially appreciated. Alternatively I may just be looking at this the wrong way? Personally I suspect it's not actually possible... Incidentally the reason for this though is mostly curiosity, most acyclic algorithms minimises in linear time to the number of states, given that the wildcards are purely filler I wondered whether the wildcards could be done away with, perhaps getting replaced by an index and a counter (not a good solution). My best idea so far is to sort of build a tree with the required states in the correct position, but that sort of creates a lot of overhead. [link] [comments]  |
| Inching closer to a DNA-based file system -- ArsTechnica Posted: 20 Feb 2018 04:30 PM PST |
| Idea to solve traveling salesman problem, is this stupid or not? Posted: 20 Feb 2018 10:53 AM PST So I had this idea for some time, it would be a physical simulation. Let's say we have N cities traveling salesman problem. We place N devices on a plane so that their positioning corresponds to the arrangement of our cities. Each device is capable of two things: 1) Emit light of wavelength unique to that city/device in our system 2) Copy / retranslate wavelength that hit it So at the beginning of experiment the setup is completely dark. Then we make initial city emit a pulse of light in its wavelength. This fucker propagates, and as it hits other devices it activates them, but those activated devices now emit light in their unique wavelength + wavelength of initial device. This goes on for a short period of time, the experiment stops when a pulse of light containing all wavelengths hits back the initial device. Then I don't know we somehow backtrack that shit to get the optimal path or something. I have tried googling it and came up with this: "An Optical Solution For The Traveling Salesman Problem" https://www.osapublishing.org/oe/abstract.cfm?uri=oe-15-16-10473 which seemed to me a lot like my idea, only you know more smarter :D with interferometers and optic cables What do you think guys? Am I a smart person or a fucking dumbass? Also, there is no mention of possible optical solutions of the TSP in the Wikipedia article, should somebody add a link to https://www.osapublishing.org/oe/abstract.cfm?uri=oe-15-16-10473 ? [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