Problem Detail: I have a variant of bidding problem at hand. There are N bidders(~20) who bid for items from a pool of many items(~10K). Each bidder can bid many items. I want to maximize the number of bidders who are Read More …
IgnouGroup Social Campus
Problem Detail: I have a variant of bidding problem at hand. There are N bidders(~20) who bid for items from a pool of many items(~10K). Each bidder can bid many items. I want to maximize the number of bidders who are Read More …
Problem Detail: I have a question related to representing numbers in base 2 with floating point. For example, if I have such a number $$0.000011 cdot 2^3$$ then is its normalized form this? $$1.1cdot 2^{-2}$$ Generally speaking about normalizing, normalizing with Read More …
Problem Detail: WalkSAT and GSAT are well-known and simple local search algorithms for solving the Boolean satisfiability problem. The pseudocode for the GSAT algorithm is copied from the question Implementing the GSAT algorithm – How to select which literal to flip? Read More …
Problem Detail: Given the PDA $P = (Q_P,Sigma,Gamma_P,delta_P,F_P)$ and the DFA $D = (Q_D, Sigma, delta_D,q_D,F_D)$ What is the 6-tuple definition of the PDA such that: $L(P’) = L(P) cap L(D)$ I don’t understand what the intersection of these two FAs Read More …
Problem Detail: I have a list and want to select a random item from the list. An algorithm which is said to be random: When you see the first item in the list, you set it as the selected item. When Read More …
Problem Detail: I just wrote a program that runs the Travelling Salesman Problem using the Nearest Neighbor Algorithm. Afterwards, I started looking into Minimum Spanning Trees (MST). From my understanding: The Nearest Neighbor Algorithm traverses a graph starting at one vertex, Read More …
Problem Detail: Now I tried tackling this question from different perspectives (and already asked a couple of questions here and there), but perhaps only now can I formulate it well and ask you (since I have no good ideas). Let there Read More …
Problem Detail: Using python need to code a recursive function with one input and no global integers that calculates the number of options to get $x$ using $a*1+b*2+c*3$. Say $x=3$, there are four options: $lbrace (1,1,1),(1,2),(2,1),(3)rbrace$. Asked By : yuvalz Answered By Read More …
Problem Detail: I am a sophomore taking a course in algorithm analysis. We were asked by our professor to calculate time-complexity of several C functions, but some of them were incorrect and would result in a compile error. As far as Read More …
Problem Detail: Here is the question: I have a given tree with n nodes. The task is to find the number of subtrees of the given tree with outgoing edges to its complement less than or equal to a given number Read More …