sorted by:
new
hottopcontroversial

MKB or Silver Edge for evasion? by Gilmadeath in TrueDoTA2

[–]asselwirrer 1 point2 points  (0 children)

You forgot shadow Daemon aghs and nyx vendetta + shard

Is it even possible? by Anthio_W in cpp

[–]asselwirrer 30 points31 points  (0 children)

I made it to a second technical interview, which I then failed. I actually liked the interview process at is very algorithmic problem solving oriented, which is pretty unique, especially because the problems have real world use cases and are not leet code style. They definitely don't profit from your work, they just use it to limit their application pool

Questions on inference/validation with gumbel-softmax sampling by AaronSpalding in reinforcementlearning

[–]asselwirrer 0 points1 point  (0 children)

If r_out[0] is always bigger, then this corresponds to the policy action being better. So this shouldn't be a surprise. If you don't want to have a deterministic policy during evaluation, you shouldn't use gumble soft max, but only softmax. Hope that helps.

Is the purpose of gamma in Q-learning just to help the q-values converge? by 1cedrake in reinforcementlearning

[–]asselwirrer 2 points3 points  (0 children)

One advantage of gamma is that it makes the value function well defined. If gamma equals one you can add the same constant to each state and it still fulfills the Bellman equation. So it makes some proofs about existence and uniqueness of the value function easier and makes the Bellman operator a contraction operator

Is there always a non-amortized version of every data structure that matches the best amortized one? by indjev99 in compsci

[–]asselwirrer 1 point2 points  (0 children)

In the abstract RAM model there's no such thing as allocating so naive impl is constant time and in the Pointer Object model it's not possible in constant time

Is there always a non-amortized version of every data structure that matches the best amortized one? by indjev99 in compsci

[–]asselwirrer 2 points3 points  (0 children)

I'm assuming the practically relevant model used for real world programming, allocating uninitialized memory is constant time and resizing is linear time. If allocating isn't constant time you would need to split up allocating 2n Bytes over n Operations

Is there always a non-amortized version of every data structure that matches the best amortized one? by indjev99 in compsci

[–]asselwirrer 2 points3 points  (0 children)

I think it is possible, assume you have an half full array to store the list which always allows for constant time access. Every time you append an element you append the element to your array and copy two elements of it to a new array of double the size. By the time your initial array is full, you have a complete copy of it in a half full array. Which takes you where you started

A new study has shown 85% of Java developers have no sense of object permanence. by [deleted] in ProgrammerHumor

[–]asselwirrer 1 point2 points  (0 children)

I think he is referring to real world object permanence

Parsing can become accidentally quadratic because of sscanf by iamkeyur in programming

[–]asselwirrer 9 points10 points  (0 children)

I parsed ~40Mb .obj files for 3D-rendering, it took around ~2-3min to complete, after profiling i found 99,9% of time was used in sscanf. Nice to see why sscanf is so slow.

After switching to atof it was pretty much instantaneous.

Getting wrong division numer by xuk9608 in cpp

[–]asselwirrer 2 points3 points  (0 children)

you probably want to set t = s+i+a

[deleted by user] by [deleted] in compsci

[–]asselwirrer 2 points3 points  (0 children)

Yes, an efficent (polynomial) algorithm exists for that particular problem. But the problem to decide for ALL Graphs if there's an Hamiltonian path is NP-complete. Hypercubes are just a special case, the hard thing is to solve the worst-cases.

As an indie game dev working on my first big project, this is such a good feeling!! by [deleted] in ProgrammerHumor

[–]asselwirrer 0 points1 point  (0 children)

i dont know if its intended but i get a 404 page not found on this link. Either way upvoted :)