Problem Detail: Is “party attendance” type of problems solvable in Prolog? For example: Burdock Muldoon and Carlotta Pinkstone both said they would come if Albus Dumbledore came. Albus Dumbledore and Daisy Dodderidge both said they would come if Carlotta Pinkstone came. Read More …
Blog
Extract Max for a max-heap in $log n + loglog n$ comparisons
Problem Detail: Given a max heap with extract-max operation. The basic version takes $2 log n$ comparisons. How can I make the running time just $log n + loglog n$ comparisons? How about $log n + logloglog n $ comparisons? I Read More …
Standard or Top Text on Applied Graph Theory
Problem Detail: I am looking for a reference text on applied graph theory and graph algorithms. Is there a standard text used in most computer science programs? If not, what are the most respected texts in the field? I have Cormen Read More …
Using Funk SVD with SGD?
Problem Detail: I work on a recommender system framework which is implemented with a variant on Funk SVD (See his explanation of his algorithm here). However the framework that we are trying to integrate doesn’t support Funk SVD, only SGD (Stochastic Read More …
Explanation of Tag, Index, and Offset in Direct Mapping Cache
Problem Detail: I’m going through an exercise trying to store address references into a direct mapped cache with 128 blocks and a block size of 32 bytes. The address are 20000, 20004, 20008, and 20016 in base 10. When I start Read More …
How do I find my wife in a supermarket?
Problem Detail: If two people are lost in a maze, is there an algorithm that they can both use to find each other without having previously agreed what algorithm they will be using? I think there are some characteristics that this Read More …
Minimum s-t cut in weighted directed acyclic graphs with possibly negative weights
Problem Detail: I ran into the following problem: Given a directed acyclic graph with real-valued edge weights, and two vertices s and t, compute the minimum s-t cut. For general graphs this is NP-hard, since one can trivially reduce max-cut to Read More …
Which algorithms can not be parallelized?
Problem Detail: Is there any algorithm which is very difficult to parallelize or the research is still active? I wanted to know about any algorithm or any research field in parallel computing. Anything, I searched for, has a ‘parallel’ implementation done. Read More …
Is resolution complete or only refutation-complete?
Problem Detail: Going through some knowledge representation tutorials on resolution at the moment, and I came across slide 05.KR, no77. There it is mentioned that “the procedure is also complete”. I think this completeness can not mean that if a sentence Read More …
Advantages and disadvantages of microcoded vs hardcoded architectures
Problem Detail: Preamble I can’t understand what are the advantages and disadvantages of microcoded processor architecture and hardcoded one. Basically what I understood is that a microcode architecture divides an istruction in more microinstructions. I didn’t found much documentation written Read More …
