• Breaking News

    Wednesday, August 21, 2019

    Home Unlabelled Interesting, wonder why there is a dip at 45 years of experience? Computer Science

    Interesting, wonder why there is a dip at 45 years of experience? Computer Science

    August 21, 2019

    Interesting, wonder why there is a dip at 45 years of experience? Computer Science

    Interesting, wonder why there is a dip at 45 years of experience?

    Posted: 20 Aug 2019 03:23 PM PDT

    How to create vertex-cover solved graphs

    Posted: 21 Aug 2019 04:07 AM PDT

    I need to create a large dataset of random graphs which the vertex-cover problem is solved for them. I can't simply create random graph and solve the problem for them (best approximation solvers in python I could find use 2-approximation), but maybe there is some kind of "cheat" way to build the graphs so they will represent a good "solved" dataset. - for example creating a set of vertices which are decided from the beginning to become the vertex cover, and adding vertices and edges in a way that won't change that (pretty simple - cluster of star-graphs)

    Putting it more clearly, I want to efficiently create a set of "solved" graphs, such that for every graph G(V,E) in the set I know the min vertex cover.

    Sorry if was incoherent, English not my first language.

    submitted by /u/Apa212
    [link] [comments]

    Hot Chips | A California Startup Has Built an AI Chip as Big as a Notebook. Why?

    Posted: 20 Aug 2019 10:14 AM PDT

    Logarithmic Space Verifiers on NP-complete

    Posted: 20 Aug 2019 06:06 PM PDT

    Creator of Ultimate Go study guide is making one for coding interview challenges

    Posted: 20 Aug 2019 11:09 AM PDT

    Reflinks vs symlinks vs hard links: How they can help machine learning projects

    Posted: 20 Aug 2019 11:02 AM PDT

    WebAssembly allows to bring native desktop software to the web

    Posted: 20 Aug 2019 07:00 AM PDT

    Seoul National University AI Uses Text Tags to Colourize Line Drawings

    Posted: 20 Aug 2019 12:11 PM PDT

    Infinite Staircase Problem

    Posted: 20 Aug 2019 10:24 AM PDT

    I am recently on the topic "Design and analysis of Algorithms" offered by my college. So I was reading about solvability and came across the 'Infinite staircase problem'. Well, I was wondering is it physically possible to create infinite staircase which can left humans confused? And if it is possible and human brain can't solve this problem including similar set of problems which is unsolvable by computers, can we conclude this that human brain is nothing but an advanced biological computer with higher processing power than electronic computers?

    submitted by /u/Saswataunlimited
    [link] [comments]

    It's been my life long goal to build a self balancing robot, and I need you guys' help coming up with the next step(neural networking) thank you

    Posted: 20 Aug 2019 08:46 AM PDT

    I'm a high school graduate, and I've been working on this on and off for the past 3 years, a self balanced robot is a robot that keeps itself vertical on two wheels by running the motors in the direction it's falling to catch itself. The difficult thing here is that you need to know the angle of the robot, and you get that from an accelerometer(noisy) and a gyroscope(drifts). So this the best way of combing these is to use the kelman filter, which does things like if it's at an angle it will start falling, so it anticipates the speed of rotation to increase using physics and matrices. I hate setting this up so I thought I could use a neural network to do this(there are people doing this I just dont understand their terminology), also the robot could figure other things out like how motor output affects it. Also the motor output is usually controlled by PID loop which works great but this is often instead with a neural network. So if I'm using two neural networks where ones the input of the other I could just multiply the matrices, and combine them. Do you think this could work, how do you suggest I do it? And what do you think I should do to get better at using neural networks?

    submitted by /u/3nigma42
    [link] [comments]

    Are there good books on programming languages using Haskell, besides Scheme?

    Posted: 20 Aug 2019 04:56 AM PDT

    I found the following programming language books use Scheme

    • Essentials of Programming Languages by Friedman et al
    • Design Concepts in Programming Languages, by Turbak et al
    • Semantics Engineering with PLT Redex by Felleisen et al

    and this uses OCaml

    • Types and Programming Languages by Pierce et al

    Are there good PL books using Haskell?

    Does Scheme have advantage over Haskell for being used in PL books?

    Same question about OCaml or SML.

    Does Haskell have similar features as Scheme and OCaml/SML to make it also suitable for the same purpose?

    Thanks.

    submitted by /u/timlee126
    [link] [comments]

    Python framework for Git

    Posted: 20 Aug 2019 06:39 AM PDT

    PID Loops and the Art of Keeping Systems Stable

    Posted: 20 Aug 2019 06:05 AM PDT

    I created a decision problem that's meant to be NP-complete, but requires solving its unary variant. So, how do I reduce binary-knapsack <p my problem?

    Posted: 19 Aug 2019 08:08 PM PDT

    Decision- While unary subset-sum excludes value 0, do both sets share an equal subset-sum? (for the input value(s) X)?

    Examples

    Subset-Sum Instances

    The first instance is represented in integers, but on a computer, it is considered NP-complete.

    1,2,3= Is there a subset that equals 5?

    Yes

    Unary Subset Sum Instance

    1, 11, 111, 1111=Is there a subset that equals 5?

    Yes

    While unary subset-sum excludes value 0, do both sets...

    YES

    Facts:

    Unary Subset-Sum is in P

    Binary-Subset-Sum is in NP

    P⊆NP

    Since P⊆NP then Unary-SSum is a subset of NP

    Proof by contradiction

    Decision Problem: Given two different sets of numbers. The first is represented in integers, and the second is represented in unary.

    While unary subset-sum excludes value 0, do both sets share an equal subset-sum? (for the input value(s) X)

    Restriction: You are always solving the NP-complete problem Subset-Sum. Unary-Subset-sum instances always exclude values 0.

    1. My decision problem is not NP-complete because the restriction require solving random instance of Binary-Subset-Sum.
    2. Subset-Sum is NP-complete. My decision problem is also in NP, and the restriction is to solve a random instance of subset-sum on your computer first.

    Subset-Sum is NP-complete. Which is NP-hard and in NP.

    So my problem is NP-hard because of the subset-sum restriction and is shown to be in NP.

    Therefore, my problem is NP-complete.

    This is likely to be wrong.

    Question

    How would I reduce another binary NP-complete problem < My problem?

    I need to reduce a NP-complete problem that only is represented in binary to my problem while all unary instances exclude the value 0. >;-)

    submitted by /u/Hope1995x
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment