In this paper, we propose an adaptive motion search window location algorithm which incorporates multiresolution motion estimation information and the motion vector information predicted from neighboring encoded blocks. To reduce the computational complexity, we employ the spatial and temporal search range reduction that we proposed in [1]. Our proposed fast search is implemented and tested in ...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

in this research work, the impact of user’s behavior on search engine results is discussed. it aims to improvement of search results which leads to the higher satisfaction of users. in other words, we are trying to present a personalized search engine for each user, based on his/her activity and search history. we base our hypothesis that the search history of each user in a specific time frame...

this paper considers the search problem, introduced by srivastava cite{sr}. this is a model discrimination problem. in the context of search linear models, discrimination ability of search designs has been studied by several researchers. some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possible non...