Learn More
Matrix computation is used as a basis for information retrieval in the retrieval strategy called Latent Semantic Indexing (LSI) [1]. The premise is that more conventional retrieval strategies (i.e. vector space, probabilistic and extended Boolean) all have problems because they match directly on keywords. Since the same concept can be described using many(More)
Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and represents an NP-complete problem. Therefore, using meta-heuristic algorithms is a suitable approach in order to cope with its difficulty. In many meta-heuristic algorithms, generating individuals in the initial step has an(More)
This study investigated the use of Genetic algorithms in Information retrieval in the area of optimizing a Boolean query. A query with Boolean logical operators was used in information retrieval. For Genetic algorithms, encoding chromosomes was done from Boolean query; where it was represented in the form of tree prefix with indexing for all terms and all(More)
This paper introduces a novel method for semantic annotation of web pages. We perform semantic annotation with regard to unwritten and empirically proven agreement between users and web designers using web patterns. This method is based on extraction of patterns, which are characteristic for a particular domain. A pattern provides formalization of the(More)
Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and is an NP-complete problem. Therefore using meta-heuristic algorithms is a suitable approach in order to cope with its difficulty. In meta-heuristic algorithms, generating individuals in the initial step has an important effect on(More)
In this article we discuss a simple hash function based upon properties of a well-known combinatorial design called quasigroups. The quasigroups are equivalent to the more familiar Latin squares and one of their most important properties is that all possible element of certain quasigroup occurs with equal probability. Actual implementations are based on(More)