Is there a way to implement the travelling sales man or purchaser algorithm but with dependencies between location, so I have to grab item X before item B. Is there any research regarding this problem ?Read more
Is there a way to implement the travelling sales man or purchaser algorithm but with dependencies between location, so I have to grab item X before item B. Is there any research regarding this problem ?Read more
what is latest google algorithm updation?Read more
I am trying to write up a paper with some results form Mathematica (11.2) among other things. I need to know what algorithm does it use when I solve a system of polynomial equations which is underdetermined (infinitely many solutions). In particular, sometimes Mathematica also find real solutions that are embedded into the complex positive-dimensionalRead more
According to the Ethash algorithm described here, the computation for each nonce requires a loop of 64 iterations, where each iteration reads a chunk of 128 bytes from a pseudo-random location in memory. Reported hash rates for the NVIDIA GTX 1070 are around 30MH/s, which means that every second this GPU is reading 30.000.000 noncesRead more
Kindergarten Excurison The kindergarten teachers had finally managed to get all the kids in a line for the walk to the bus station and the weekly excursion. What they hadnâ€™t thought of was the fact that today different kids were supposed to go to different excursions. They should walk as one line to the busRead more
I’m currently trying to create a system for a specific tournament but I can’t figure out how to generate the matches table. I have a tournament with <T> teams. Each team needs to play vs each other team exactly once. The tournament location has <M> fields which can be played on at the same timeRead more
This is Algorithm A from Functional Programs for Generating Permutations (Topor, 1982). We have implemented Algorithm A in F# as follows. let rec put (a: ‘t) (p: List<‘t>) (q: List<‘t>) : List<‘t> = if p = q then a :: q else p.Head :: (put a p.Tail q) // a: an element // p: aRead more
Because I can use my PC to mine Bitcoin using the Scrypt algorithm. I use NiceHash. They have an option to select which algorithm we want to use. So I was wondering, once I get my Antminer S3, is it possible to point it to NiceHash’s Scrypt stratum and mine using the Scrypt algorithm?Read more
Here below is an implementation of the Ukkoken’s algorithm in C++. Please review for correctness, robustness and performance. #include “suffix_tree.h” #include <cassert> #include <iostream> using namespace std; class node { public: node(); ~node(); int m_begin; int m_end; node* m_parent; node* m_first_child; node* m_sibling; node* m_suffix_link; }; class suffix_tree_impl { public: suffix_tree_impl(string s); ~suffix_tree_impl(); private: charRead more
I’m trying to come up with a solution to a coding challenge on Kattis, where there is a 2D grid filled with x’s and o’s, and the goal is to figure out whether or not a given starting coordinate can reach a given end coordinate by traveling up, down, left, or right. Only the o’sRead more