Showing papers on "Cognitive network published in 1981"

Example 3: Communication network

Abstract: Reducibility Reduction is used to reduce a given problem to a known problem. Say we have an efficient algorithm, say A, that has complexity O(n 2). If we know of a reduction for a new problem in space and time O(klogk) where k is the size of the new problem, then we can solve it in time O((klogk) 2) + O(klogk), which has the asymptotic complexity of O((klogk) 2). Point to be taken: Strive to cast a new problem in terms of one you know and can solve efficiently. Consider a communication network with loss probabilities along edges. The first thing we do is convert all loss probablities to success probabilities. This is because a packet being lost along an edge ⇒ the packet is lost along any path that starts from its destination vertex. Probability of successful transmission = e∈E (1-P e).