A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
In this paper we explore which bundles of services are attractive to users. We look specifically in bundle composition with navigation services as core, and travel and entertainme...
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
The primary objective of this paper is to critically evaluate empirical research on some variables relating to the configuration of text on screen to consolidate our current knowle...