Problem Detail: Couldn’t find much online on how an interactive system is different from a time-sharing system, or the different traits of both. My understanding of a time-sharing system is many people at terminals being able to use the system at Read More …
Category: Uncategorized
[Solved]: Computing the number of squares which are intersected by a line internally
Problem Detail: There’s a line from (x1,y1) to (x2,y2) in a grid of squares of unit length. Write a program to compute the number of squares which are intersected by the line internally, i.e squares which are only touched by the Read More …
[Solved]: Why would you introduce the goto statement into a modern language?
Problem Detail: I just found out something really quite extraordinary. While looking through Stackoverflow, I came across a question about removing goto from a php function. PHP doesn’t have goto I thought and looked it up on php.net. It turns out Read More …
[Solved]: How hard is a variant of Sudoku puzzle?
Problem Detail: Sudoku is well known puzzle which is known to be NP-complete and it is a special case of more general problem known as Latin squares. A correct solution of the $N times N$ square consists of filling every row Read More …
[Solved]: What is the appropriate means of bias field in image processing?
Problem Detail: I want to do image segmentation. in an article about A Level Set Method for Image Segmentation I saw that the outer use bias field estimation. I searched a lot but I couldn’t understand the meaning of bias field…What Read More …
[Solved]: Rigorous Books on Algorithms
Problem Detail: I thoroughly enjoyed my algorithms class but I felt that it lacked rigor. Most of the time I was able to intuitively understand why the algorithms presented worked and why they had the time complexity that was presented but Read More …
[Solved]: How to enumerate minimal covers of a set
Problem Detail: I have a set $S$ and a set $P = {P_{1},…,P_{n}}$ with $bigcup P_{i} = S$. I want to find all the inclusion-minimal subsets of $P$ that are covers of $S$. What is the best algorithm for enumerating all Read More …
[Solved]: Which hazards are solved by instruction reordering?
Problem Detail: I am not clear on whether it’s data and control hazards, or control hazards only. Also, the “solved” word confuses me – technically, instruction reordering is used to solve dependences and thus prevent hazards from happening in the first Read More …
[Solved]: k-armed bandit – index policies vs. Q-learning
Problem Detail: I am interested in the stateless k-armed bandit problem, where an agent repeatedly chooses one of k independent arms, each with a different distribution of rewards, and tries to maximize its total reward. I read many papers about this Read More …
[Solved]: Formal language without grammar
Problem Detail: Definitions: Alphabet $Σ$: finite, non-empty set Language: subset of $Σ^*$ Grammar: Unrestricted grammar (Chomsky Type 0) Language of a grammar: all words that can be produced by applying $P$ multiple times, starting from $S$ Grammars are finite, therefore there Read More …
