IgnouGroup Social Campus
Problem Detail: tl;dr What does the Minimax algorithm do when all its options are the same? Consider this Minimax tree: (Green means the ends, orange minimize, blue maximize) (Source: Myself) Imagine this is the tree for a game (tic-tac-toe, maybe?). What Read More …
Problem Detail: Is the cardinality of the set of partially recursive functions greater than the cardinality of the set of recursive functions ? Asked By : chgsilva Answered By : lPlant No they have the same cardinality. They have the cardinality $aleph_0$. Both Read More …
Problem Detail: I am looking for the longest simple path in a directed, cyclic and weighted graph with positive and negative weights. In my research so far I have found out that you need to generate -G from graph G and Read More …
Problem Detail: Suppose we have a set of functions $f_i: mathbb Z rightarrow {0,1}, i=1, dots,n $, with the following property: For each $i =1,dots ,n$, there exists an $xin mathbb Z$ such that $f_i(x)=0$ and $f_j(x)=1$ for each $jin {1,dots,i-1,i+1,dots,n}$. Read More …
Problem Detail: Problem I want to implement an optimization algorithm for my file transfer program. The program buffers data in a local file before uploading to central server periodically and it compresses the files before transferring. I would want the program Read More …
Problem Detail: We’re facing following problem – an n * n 2D Matrix contains doubles (Java). Find a Set of elements such that Each element in the set comes from a unique row and column combination. That is, once you’ve selected Read More …
Problem Detail: I have been reading the paper Towards a Cognitive System for Decision Support in Cyber Operations. And I have been trying to understand the role of two ontologies proposed here, cyber security ontologies and scenario ontologies. I have asked Read More …
Problem Detail: I have been reading a lot and I am still unsure of how to determine this. Let’s say I have an initial binary state vector (1, 1, 1). How would I go about determining whether (1, 1, 1) is Read More …
Problem Detail: Having found one minimum vertex cover of a connected undirected graph, is there a known polynomial-time algorithm for finding all the other minimum vertex covers of the graph, or is this problem NP-complete as well? Another question: what other Read More …
Problem Detail: The Adler32 algorithm has a shortcoming as noted on Wikipedia: Jonathan Stone discovered in 2001 that Adler-32 has a weakness for very short messages. He wrote “Briefly, the problem is that, for very short packets, Adler-32 is guaranteed to Read More …
