Problem Detail: I am trying to use the genetic algorithm to optimise a multi-layered neural network for image classification (i am using a subset of the MNIST handwritten digit data set as my initial dataset, but eventually would like to make Read More …
Category: Uncategorized
[Solved]: How to read out a double negation in propositional logic
Problem Detail: How would one verbally say ~~R where R = my program is correct? The tildes are negation symbols. I’m not sure if it just cancels out and comes out as ‘my program is correct’ or if it’s something else. Read More …
[Solved]: Classification of job shop scheduling problems
Problem Detail: I’m writing a program (using genetic algorithms) that finds sort-of-optimal scheduling plan for a factory. The factory has several types of machines (say, locksmith, miller, welding) There are few machines of each type. (say, 3 locksmiths, 2 millers, 3 Read More …
[Solved]: If a point is a vertex of convex hull
Problem Detail: The exercise is Given a set of point $S$ and a point $p$. Decide in $O(n)$ time if $p$ is a vertex of convex polygon formed from points of $S$. The problem is I am a little bit confused Read More …
[Solved]: What does an input string of epsilon mean?
Problem Detail: I am currently reading Introduction to the Theory of Computation (Sipser), and after introducing epsilon labeled transition arrows, the book shows the following NFA: I was following it until I read the following : Practice with it to satisfy Read More …
[Solved]: How can an algorithm have exponential space complexity but polynomial time complexity?
Problem Detail: For enumerating the minimal feedback vertex sets of a graph Schwikowski and Speckenmeyer show an algorithm “GENERATE-MFVS” in their publication “On enumerating all minimal solutions of feedback problems“. It is said that it runs in polynomial time but uses Read More …
[Solved]: Is it possible to get Nth Fibonacci number in sublinear time?
Problem Detail: I was researching the topic of Fibonacci numbers and asymptotic complexity of generating them. Coming across a seemingly paradoxical conclusion, I’ve decided to check out if you agree with my explanation. The naive algorithms runs in $O(n)$, if we Read More …
[Solved]: Category theory (not) for Programming?
Problem Detail: After learning Haskell and other not so pure FP languages I decided to read about Category theory. After gaining good understanding of Category theory I started thinking about how the concepts of category theory can be used to think Read More …
[Solved]: Why is the node with the greatest DFS post-order number not necessarily a sink?
Problem Detail: A sink in a directed graph is a node with no outgoing edges. If I perform a depth first search, why is it that the node with the least post-order number (and thus the highest pre-order number) not necessarily Read More …
[Solved]: Converting regular (Type-3) grammar to a deterministic finite state automaton
Problem Detail: I would like to create a deterministic finite state automaton (DFA) M=(Q, Σ, δ, q0, F) that is accepting the language generated by the following regular grammar (RG) G=(N, Σ, P, S). In short I want to convert RG Read More …
