Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
Service-oriented computing paradigm encourages the use of dynamic binding of application requirements to the resources needed to fulfill application tasks. Especially in pervasive...
Nanjangud C. Narendra, Umesh Bellur, S. K. Nandy, ...