the main challenge of a search engine is ranking web documents to provide the best response to a user`s query. despite the huge number of the extracted results for user`s query, only a small number of the first results are examined by users; therefore, the insertion of the related results in the first ranks is of great importance. in this paper, a ranking algorithm based on the reinforcement le...

the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...

in this paper, we have outlined the surrogate management framework for optimization of expensive functions. an initial simple iterative method which we call the “strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. these ideas are made rigorous by incorporating them into the framework of pattern search methods. the smf al...

Search protocols are among the main applications of RFID systems. Since a search protocol should be able to locate a certain tag among many tags, not only it should be secure against RFID threats but also it should be affordable. In this article, an RFID-based search protocol will be presented. We use an encryption technique that is referred to as authenticated encryption in order to boost the ...

This paper explores empirical merits of a version Agree that is defined based on Minimal Search (MS-Agree). Compared to the standard Agree, MS-Agree, essentially search algorithm, uniquely allows independent assignment its target and domain. unique feature enables MS-Agree accommodate both upward downward agreement phenomena, offers unified analysis for negative concord, inflection doubling, mu...

consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. in the noisy case, search probability is given by shirakura et al. (ann. statist. 24(6) (1996) 2560). in this paper some new properties of the searching probability are presented. new properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...