Coding theory is the subject which is concerned with how information can be sent over a noisy channel. A code then is a collection of codewords which are strings of a fixed number of letters from an alphabet. Some of these strings are codewords others are not. When a codeword is sent over a channel there is a probability less than /2 that each letter in the codeword will be changed, thus introd...

This research Paper represents a recent use of the extended local binary pattern for face recognition. Extended Local Binary Pattern (ELBP) Technique is more accurate and describes the texture and shape of a digital image by using of 3*3 & 5*5 matrices we have to compare the performance of both matrices so that how we recognize the image. Variance help to measure continuous output where the qua...

ABSTRACT Congestion ontrol in the Internet relies on binary adjustment algorithms. For example, Transmission Control Proto ol (TCP) in its ongestion avoidan e mode behaves similarly to Additive-In rease Multipli ative-De rease (AIMD) algorithm. The lassi al analysis by Chiu and Jain re ommends AIMD based on the assertion that among stable linear algorithms, AIMD ensures the qui kest onvergen e ...

Suppose we know that an object is in a sorted table and we want to determine the index of that object. To achieve this goal we could perform a binary search[1]. However, suppose it is time-consuming to determine the relative position of that object to any other objects in the table. In this scenario, we might want to resort to an incomplete solution: we could device an algorithm that quickly pr...

Wederive exactmoments of the number of 2-protected nodes in binary search trees grown from random permutations. Furthermore, we show that a properly normalized version of this tree parameter converges to a Gaussian limit. © 2012 Elsevier Ltd. All rights reserved.

In this paper, we proposed Evolutionary Organizational Search (EOS), an optimization method for the organizational control of multi-agent systems (MASs) based on genetic programming (GP). EOS adds to the existing armory a metaheuristic extension, which is capable of efficient search and less vulnerable to stalling at local optima than greedy methods due to its stochastic nature. EOS employs a f...

The task of artificial intelligence is to provide representation techniques for describing problems, as well as search algorithms that can be used to answer our questions. A widespread and elaborated model is state-space representation, which, however, has some shortcomings. Classical search algorithms are not applicable in practice when the state space contains even only a few tens of thousand...

Search Computing defines a new class of applications, which enable end users to perform exploratory search processes over multi-domain data sources available on the Web. These applications exploit suitable software frameworks and models that make it possible for expert users to configure the data sources to be searched and the interfaces for query submission and result visualization. We describ...

The underlying motivation for the work presented in this paper is to usefully understand what is called the value of computation (Russell & Wefald 1991). By this intuitively mean the following. Suppose we have some computational process C which, at some point, has a choice between the computations co and cl. We would like to be able to make claims of the form: co is a better choice for C than c...

Congestion control in the Internet relies on binary adjustment algorithms. For example, Transmission Control Protocol (TCP) in its congestion avoidance mode behaves similarly to Additive-Increase MultiplicativeDecrease (AIMD) algorithm. Chiu and Jain offer a theoretical justification for choosing AIMD: among stable linear algorithms, AIMD ensures the quickest convergence to maxmin-fair states. ...