Problem Detail: Interested in learning more about algorithm design in functional programming, I picked up Andrew Bird’s Pearls of Functional Algorithm Design. I have experience with a number of programming languages, but my only experience with functional programming is in Scala. Read More …
Blog
[Solved]: Neural Network weight selection using Genetic Algorithm
Problem Detail: Hi I want to ask about weight selection in neural network using genetic algorithm. Right now what I understand is Initialize population Encode the weight of the neural network to the chromosome Calculating the error and fitness crossover and Read More …
[Solved]: r-regular graph and hamiltonian path
Problem Detail: I am having some issues proving a problem I am working on. I have been sketching out examples but the proof is not jumping out at me. Question: Let $G = (V,E)$ be an undirected $r$-regular graph (that is Read More …
[Solved]: Why is O(n log n) the best runtime there is?
Problem Detail: I am taking a course on Coursera about algorithm design. The course said that a time of $O(n log n)$ is considered to be good. However, there are faster runtimes such as (from now on just assume it is Read More …
[Solved]: Height of a full binary tree
Problem Detail: A full binary tree seems to be a binary tree in which every node is either a leaf or has 2 children. I have been trying to prove that its height is O(logn) unsuccessfully. Here is my work so Read More …
[Solved]: Weighted Set covering problem with a fixed number of colors
Problem Detail: I have a set of elements U = {1, 2, …. , n} and a set S of k sets whose union form the whole universe. Each of these sets is associated with a cost. I have a fixed Read More …
[Solved]: Radix sort exercise
Problem Detail: I’m trying to understand a proof regarding radix-sort but to no avail. I’ll first write down a brief summary of the proof and then assign some questions which I hope will be clarified enough. Suppose you have an array Read More …
[Solved]: Why addition algorithm is not pseudo- polynomial?
Problem Detail: There is something I don’t understand. In the Subset Sum problem, in the Dynamic Programming solution, because of binary representation of the sum T, we say it is pseudo-polynomial in run time; we must sum in the worst case Read More …
[Solved]: Minimal Spanning tree and Prim’s Algorithm
Problem Detail: Is there any example that anybody could come up with that shows Prim’s algorithm does not always give the correct result when it comes knowing the minimal spanning tree. Asked By : fudu Answered By : Kaya For any un-directed graph Read More …
[Solved]: Proving Infinite Turing Machine Language (with finite subset) is Recursively Enumerable
Problem Detail: I’m trying to answer this question: Let $S$ be the strings $langle P rangle$ accepted by the Turing Machine $P$ with input alphabet ${a,b}$, where $P$ accepts an infinite number of strings beginning with $a$ and a finite number Read More …
