An asymptotically optimal sorting algorithm that uses $\Theta \left(n\right(logn+k\left)\right)$ component comparisons to lexicographically sort the set of $n$$k$-tuples is presented. This sorting algorithm builds the static data structure - the so called optimal lexicographic search tree - in which it is possible to perform member searching for an unknown $k$-tuple in at most $[\left(lo{g}_2(n+1)\right]+k-1$ comparisons. The number of comparisons...

Genetic algorithms are adaptive methods that use principles inspired by natural population genetics to evolve solutions to search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is premature convergence; the search becomes trapped in a local optimum before the global optimum is found. Fuzzy logic techniques may be used for solving this problem. This...

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...

In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm and compared...

Any sequence $x={\left(x_k\right)}_{k=1}^{\infty }$ of distinct numbers from [0,1] generates a binary tree by storing the numbers consecutively at the nodes according to a left-right algorithm (or equivalently by sorting the numbers according to the Quicksort algorithm). Let $H_n\left(x\right)$ be the height of the tree generated by $x_1,\cdots ,x_n.$ Obviously$$\frac{logn}{log2}-1\le H_n\left(x\right)\le n-1.$$If the sequences $x$ are generated by independent random variables having the uniform distribution on [0, 1], then it is well known that there exists $c$ > $0$ such that $H_n\left(x\right)\sim clogn$ as $n\to \infty$ for almost all sequences $x$. Recently...